Base | Representation |
---|---|
bin | 1001000110111010101101… |
… | …0101100011111011011100 |
3 | 1022110101000202220002100222 |
4 | 2101232223111203323130 |
5 | 2303034034442314400 |
6 | 33144323255340512 |
7 | 2052343145513066 |
oct | 221565325437334 |
9 | 38411022802328 |
10 | 10014443323100 |
11 | 32111131a8487 |
12 | 1158a48981738 |
13 | 578486566c58 |
14 | 2689b7446736 |
15 | 125772e46185 |
hex | 91bab563edc |
10014443323100 has 36 divisors (see below), whose sum is σ = 21736750035000. Its totient is φ = 4004780458560.
The previous prime is 10014443323097. The next prime is 10014443323111. The reversal of 10014443323100 is 132334441001.
It is a happy number.
It is a super-2 number, since 2×100144433231002 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10014443323100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12056975 + ... + 12860774.
Almost surely, 210014443323100 is an apocalyptic number.
10014443323100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10014443323100 is an abundant number, since it is smaller than the sum of its proper divisors (11722306711900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10014443323100 is a wasteful number, since it uses less digits than its factorization.
10014443323100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24921782 (or 24921775 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 10014443323100 its reverse (132334441001), we get a palindrome (10146777764101).
The spelling of 10014443323100 in words is "ten trillion, fourteen billion, four hundred forty-three million, three hundred twenty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •