Base | Representation |
---|---|
bin | 11101110010000110110… |
… | …10010111000010001101 |
3 | 10121211101211221210120010 |
4 | 32321003122113002031 |
5 | 113231241244400023 |
6 | 2102040205543433 |
7 | 133635102452145 |
oct | 16710332270215 |
9 | 3554354853503 |
10 | 1023333200013 |
11 | 364aa1a05473 |
12 | 1463b4274b79 |
13 | 756663ab177 |
14 | 3775b2ab925 |
15 | 1b944e42093 |
hex | ee4369708d |
1023333200013 has 8 divisors (see below), whose sum is σ = 1444705694208. Its totient is φ = 642091419584.
The previous prime is 1023333200009. The next prime is 1023333200051. The reversal of 1023333200013 is 3100023333201.
1023333200013 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1023333200013 - 22 = 1023333200009 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023333201013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10032678381 + ... + 10032678482.
It is an arithmetic number, because the mean of its divisors is an integer number (180588211776).
Almost surely, 21023333200013 is an apocalyptic number.
It is an amenable number.
1023333200013 is a deficient number, since it is larger than the sum of its proper divisors (421372494195).
1023333200013 is a wasteful number, since it uses less digits than its factorization.
1023333200013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20065356883.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 1023333200013 its reverse (3100023333201), we get a palindrome (4123356533214).
The spelling of 1023333200013 in words is "one trillion, twenty-three billion, three hundred thirty-three million, two hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •