Base | Representation |
---|---|
bin | 101011110110010111011… |
… | …010001110101100000111 |
3 | 101200001212220201200201111 |
4 | 223312113122032230013 |
5 | 343332230422410043 |
6 | 10224144020305451 |
7 | 430463455011421 |
oct | 53662732165407 |
9 | 11601786650644 |
10 | 3013312310023 |
11 | a61a36273294 |
12 | 408000242287 |
13 | 18b20081c822 |
14 | a5bb8d1b811 |
15 | 535b32d709d |
hex | 2bd9768eb07 |
3013312310023 has 2 divisors, whose sum is σ = 3013312310024. Its totient is φ = 3013312310022.
The previous prime is 3013312309967. The next prime is 3013312310033. The reversal of 3013312310023 is 3200132133103.
It is a strong prime.
It is an emirp because it is prime and its reverse (3200132133103) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3013312310023 - 229 = 3012775439111 is a prime.
It is a super-2 number, since 2×30133123100232 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3013312309976 and 3013312310003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3013312310033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1506656155011 + 1506656155012.
It is an arithmetic number, because the mean of its divisors is an integer number (1506656155012).
Almost surely, 23013312310023 is an apocalyptic number.
3013312310023 is a deficient number, since it is larger than the sum of its proper divisors (1).
3013312310023 is an equidigital number, since it uses as much as digits as its factorization.
3013312310023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3013312310023 its reverse (3200132133103), we get a palindrome (6213444443126).
The spelling of 3013312310023 in words is "three trillion, thirteen billion, three hundred twelve million, three hundred ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •