Base | Representation |
---|---|
bin | 1001001111001111100011… |
… | …1011000101100000111111 |
3 | 1022222001020011121120222222 |
4 | 2103303320323011200333 |
5 | 2312410004101121044 |
6 | 33334140440555555 |
7 | 2065565540211560 |
oct | 223637073054077 |
9 | 38861204546888 |
10 | 10157478926399 |
11 | 326684305a282 |
12 | 1180707182bbb |
13 | 588acccc79cc |
14 | 2718a5ca8167 |
15 | 1293453e08ee |
hex | 93cf8ec583f |
10157478926399 has 64 divisors (see below), whose sum is σ = 12657692344320. Its totient is φ = 7954320528000.
The previous prime is 10157478926369. The next prime is 10157478926411. The reversal of 10157478926399 is 99362987475101.
It is a Cunningham number, because it is equal to 31870802-1.
It is not a de Polignac number, because 10157478926399 - 228 = 10157210490943 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10157478926369) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1564852544 + ... + 1564859034.
It is an arithmetic number, because the mean of its divisors is an integer number (197776442880).
It is a 1-persistent number, because it is pandigital, but 2⋅10157478926399 = 20314957852798 is not.
Almost surely, 210157478926399 is an apocalyptic number.
10157478926399 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
10157478926399 is a deficient number, since it is larger than the sum of its proper divisors (2500213417921).
10157478926399 is a wasteful number, since it uses less digits than its factorization.
10157478926399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7812.
The product of its (nonzero) digits is 205752960, while the sum is 71.
The spelling of 10157478926399 in words is "ten trillion, one hundred fifty-seven billion, four hundred seventy-eight million, nine hundred twenty-six thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •