Base | Representation |
---|---|
bin | 1001000110101011110101… |
… | …1100101000111101111111 |
3 | 1022102222201121220002120122 |
4 | 2101222331130220331333 |
5 | 2303002401230420333 |
6 | 33142423244005155 |
7 | 2052142223524436 |
oct | 221527534507577 |
9 | 38388647802518 |
10 | 10010452201343 |
11 | 320a455328650 |
12 | 11581142307bb |
13 | 577c9b733649 |
14 | 26871936411d |
15 | 1255dc876798 |
hex | 91abd728f7f |
10010452201343 has 8 divisors (see below), whose sum is σ = 10937476978176. Its totient is φ = 9086258035800.
The previous prime is 10010452201331. The next prime is 10010452201369. The reversal of 10010452201343 is 34310225401001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10010452201343 - 228 = 10010183765887 is a prime.
It is a super-2 number, since 2×100104522013432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10010452281343) 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, 707645423 + ... + 707659568.
It is an arithmetic number, because the mean of its divisors is an integer number (1367184622272).
Almost surely, 210010452201343 is an apocalyptic number.
10010452201343 is a deficient number, since it is larger than the sum of its proper divisors (927024776833).
10010452201343 is a wasteful number, since it uses less digits than its factorization.
10010452201343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1415305645.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 10010452201343 its reverse (34310225401001), we get a palindrome (44320677602344).
The spelling of 10010452201343 in words is "ten trillion, ten billion, four hundred fifty-two million, two hundred one thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •