Base | Representation |
---|---|
bin | 1001000110010100001101… |
… | …1111010110011111011011 |
3 | 1022102101100201001000100122 |
4 | 2101211003133112133123 |
5 | 2302401404421440233 |
6 | 33135454124423455 |
7 | 2051526125334662 |
oct | 221450337263733 |
9 | 38371321030318 |
10 | 10004111124443 |
11 | 32077a0a17727 |
12 | 1156a446a7b8b |
13 | 5774caab7037 |
14 | 2682b712bdd9 |
15 | 12536ad18d98 |
hex | 919437d67db |
10004111124443 has 8 divisors (see below), whose sum is σ = 10113070971888. Its totient is φ = 9895437637984.
The previous prime is 10004111124367. The next prime is 10004111124487. The reversal of 10004111124443 is 34442111140001.
It is a happy number.
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 10004111124443 - 236 = 9935391647707 is a prime.
It is a super-3 number, since 3×100041111244433 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10004111124143) 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, 71519996 + ... + 71659737.
It is an arithmetic number, because the mean of its divisors is an integer number (1264133871486).
Almost surely, 210004111124443 is an apocalyptic number.
10004111124443 is a deficient number, since it is larger than the sum of its proper divisors (108959847445).
10004111124443 is a wasteful number, since it uses less digits than its factorization.
10004111124443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143180493.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 10004111124443 its reverse (34442111140001), we get a palindrome (44446222264444).
The spelling of 10004111124443 in words is "ten trillion, four billion, one hundred eleven million, one hundred twenty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •