Base | Representation |
---|---|
bin | 1001001110111000000010… |
… | …0010110011000100000111 |
3 | 1022221102221002120122220201 |
4 | 2103232000202303010013 |
5 | 2312304041031414101 |
6 | 33331214105111331 |
7 | 2065253213044402 |
oct | 223560042630407 |
9 | 38842832518821 |
10 | 10151164326151 |
11 | 32640a2692692 |
12 | 117b444488547 |
13 | 5883349bb764 |
14 | 2714673a4d39 |
15 | 1290c5d62e01 |
hex | 93b808b3107 |
10151164326151 has 8 divisors (see below), whose sum is σ = 10748810827440. Its totient is φ = 9553575512448.
The previous prime is 10151164326119. The next prime is 10151164326257. The reversal of 10151164326151 is 15162346115101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10151164326151 - 25 = 10151164326119 is a prime.
It is a super-2 number, since 2×101511643261512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10151164326151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10151164323151) 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, 14059341 + ... + 14763718.
It is an arithmetic number, because the mean of its divisors is an integer number (1343601353430).
Almost surely, 210151164326151 is an apocalyptic number.
10151164326151 is a deficient number, since it is larger than the sum of its proper divisors (597646501289).
10151164326151 is a wasteful number, since it uses less digits than its factorization.
10151164326151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28843793.
The product of its (nonzero) digits is 21600, while the sum is 37.
The spelling of 10151164326151 in words is "ten trillion, one hundred fifty-one billion, one hundred sixty-four million, three hundred twenty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •