Base | Representation |
---|---|
bin | 11101001000100011010… |
… | …00001100101011011101 |
3 | 10112200211000121211110002 |
4 | 32210101220030223131 |
5 | 112400043410132313 |
6 | 2043510315424045 |
7 | 132215200134212 |
oct | 16442150145335 |
9 | 3480730554402 |
10 | 1001023130333 |
11 | 356593507956 |
12 | 142008755025 |
13 | 7351c243bc5 |
14 | 36642295b09 |
15 | 1b08b4b6058 |
hex | e911a0cadd |
1001023130333 has 32 divisors (see below), whose sum is σ = 1111985301600. Its totient is φ = 896779247616.
The previous prime is 1001023130323. The next prime is 1001023130383. The reversal of 1001023130333 is 3330313201001.
It can be written as a sum of positive squares in 16 ways, for example, as 116825189209 + 884197941124 = 341797^2 + 940318^2 .
It is not a de Polignac number, because 1001023130333 - 224 = 1001006353117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001023130323) 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 in 31 ways as a sum of consecutive naturals, for example, 100368335 + ... + 100378307.
It is an arithmetic number, because the mean of its divisors is an integer number (34749540675).
Almost surely, 21001023130333 is an apocalyptic number.
It is an amenable number.
1001023130333 is a deficient number, since it is larger than the sum of its proper divisors (110962171267).
1001023130333 is a wasteful number, since it uses less digits than its factorization.
1001023130333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12881.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1001023130333 its reverse (3330313201001), we get a palindrome (4331336331334).
The spelling of 1001023130333 in words is "one trillion, one billion, twenty-three million, one hundred thirty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •