Base | Representation |
---|---|
bin | 1011101100101010… |
… | …0010000101010001 |
3 | 22002211122122000001 |
4 | 2323022202011101 |
5 | 22412331203213 |
6 | 1235331130001 |
7 | 140546261521 |
oct | 27312420521 |
9 | 8084578001 |
10 | 3140100433 |
11 | 1371560a28 |
12 | 737743901 |
13 | 3b07284c2 |
14 | 21b075681 |
15 | 135a1a1dd |
hex | bb2a2151 |
3140100433 has 2 divisors, whose sum is σ = 3140100434. Its totient is φ = 3140100432.
The previous prime is 3140100389. The next prime is 3140100437. The reversal of 3140100433 is 3340010413.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2141097984 + 999002449 = 46272^2 + 31607^2 .
It is an emirp because it is prime and its reverse (3340010413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3140100433 - 229 = 2603229521 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3140100433.
It is not a weakly prime, because it can be changed into another prime (3140100437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1570050216 + 1570050217.
It is an arithmetic number, because the mean of its divisors is an integer number (1570050217).
Almost surely, 23140100433 is an apocalyptic number.
It is an amenable number.
3140100433 is a deficient number, since it is larger than the sum of its proper divisors (1).
3140100433 is an equidigital number, since it uses as much as digits as its factorization.
3140100433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 3140100433 is about 56036.5990491928. The cubic root of 3140100433 is about 1464.3599627036.
Adding to 3140100433 its reverse (3340010413), we get a palindrome (6480110846).
The spelling of 3140100433 in words is "three billion, one hundred forty million, one hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •