Base | Representation |
---|---|
bin | 1001000011011110000000… |
… | …1011011101101100000001 |
3 | 1022020201010000202000221001 |
4 | 2100313200023131230001 |
5 | 2301101222240421101 |
6 | 33101204512332001 |
7 | 2045145100403101 |
oct | 220674013355401 |
9 | 38221100660831 |
10 | 9955200326401 |
11 | 3198a82064190 |
12 | 1149474544001 |
13 | 572a048b7115 |
14 | 265b97329201 |
15 | 123e56dc5901 |
hex | 90de02ddb01 |
9955200326401 has 8 divisors (see below), whose sum is σ = 10860419963808. Its totient is φ = 9050014260000.
The previous prime is 9955200326371. The next prime is 9955200326413. The reversal of 9955200326401 is 1046230025599.
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 9955200326401 - 213 = 9955200318209 is a prime.
It is a super-2 number, since 2×99552003264012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (9955200356401) 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 7 ways as a sum of consecutive naturals, for example, 7770700 + ... + 8960701.
It is an arithmetic number, because the mean of its divisors is an integer number (1357552495476).
Almost surely, 29955200326401 is an apocalyptic number.
It is an amenable number.
9955200326401 is a deficient number, since it is larger than the sum of its proper divisors (905219637407).
9955200326401 is a wasteful number, since it uses less digits than its factorization.
9955200326401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16785503.
The product of its (nonzero) digits is 583200, while the sum is 46.
The spelling of 9955200326401 in words is "nine trillion, nine hundred fifty-five billion, two hundred million, three hundred twenty-six thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •