Base | Representation |
---|---|
bin | 111110110000001001010… |
… | …010100000010011010111 |
3 | 120021020210210220110000111 |
4 | 332300021102200103113 |
5 | 1031123044032323111 |
6 | 13101013351223451 |
7 | 623360613542341 |
oct | 76601122402327 |
9 | 16236723813014 |
10 | 4312303011031 |
11 | 14129236a0184 |
12 | 597905677b87 |
13 | 2538577a2312 |
14 | 10ca06418291 |
15 | 7728d7e0a21 |
hex | 3ec094a04d7 |
4312303011031 has 2 divisors, whose sum is σ = 4312303011032. Its totient is φ = 4312303011030.
The previous prime is 4312303011019. The next prime is 4312303011047. The reversal of 4312303011031 is 1301103032134.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 4312303011031 - 231 = 4310155527383 is a prime.
It is a super-2 number, since 2×43123030110312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4312303010993 and 4312303011011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4312303011001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2156151505515 + 2156151505516.
It is an arithmetic number, because the mean of its divisors is an integer number (2156151505516).
Almost surely, 24312303011031 is an apocalyptic number.
4312303011031 is a deficient number, since it is larger than the sum of its proper divisors (1).
4312303011031 is an equidigital number, since it uses as much as digits as its factorization.
4312303011031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 4312303011031 its reverse (1301103032134), we get a palindrome (5613406043165).
The spelling of 4312303011031 in words is "four trillion, three hundred twelve billion, three hundred three million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •