Base | Representation |
---|---|
bin | 1001001001000010111111… |
… | …0011101100011111100101 |
3 | 1022120212110020210221012210 |
4 | 2102100233303230133211 |
5 | 2304134000020202011 |
6 | 33213213303434033 |
7 | 2055106532366511 |
oct | 222205763543745 |
9 | 38525406727183 |
10 | 10051025553381 |
11 | 322568599354a |
12 | 1163b58155919 |
13 | 57ba66511467 |
14 | 26a687b3d141 |
15 | 1266b48656a6 |
hex | 9242fcec7e5 |
10051025553381 has 8 divisors (see below), whose sum is σ = 13524315729760. Its totient is φ = 6639209539632.
The previous prime is 10051025553377. The next prime is 10051025553433. The reversal of 10051025553381 is 18335552015001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10051025553381 - 22 = 10051025553377 is a prime.
It is a super-2 number, since 2×100510255533812 (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 (10051020553381) 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, 15368540275 + ... + 15368540928.
It is an arithmetic number, because the mean of its divisors is an integer number (1690539466220).
Almost surely, 210051025553381 is an apocalyptic number.
It is an amenable number.
10051025553381 is a deficient number, since it is larger than the sum of its proper divisors (3473290176379).
10051025553381 is a wasteful number, since it uses less digits than its factorization.
10051025553381 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30737081315.
The product of its (nonzero) digits is 90000, while the sum is 39.
Adding to 10051025553381 its reverse (18335552015001), we get a palindrome (28386577568382).
The spelling of 10051025553381 in words is "ten trillion, fifty-one billion, twenty-five million, five hundred fifty-three thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •