Base | Representation |
---|---|
bin | 1001001110111000000001… |
… | …1111011010110011101100 |
3 | 1022221102221000220122211210 |
4 | 2103232000133122303230 |
5 | 2312304040320042424 |
6 | 33331214034114420 |
7 | 2065253202365052 |
oct | 223560037326354 |
9 | 38842830818753 |
10 | 10151163440364 |
11 | 32640a2138131 |
12 | 117b44411ba10 |
13 | 58833476b51b |
14 | 2714672141d2 |
15 | 1290c5c3a729 |
hex | 93b807dacec |
10151163440364 has 24 divisors (see below), whose sum is σ = 24263756517168. Its totient is φ = 3301191362560.
The previous prime is 10151163440339. The next prime is 10151163440377. The reversal of 10151163440364 is 46304436115101.
It is a happy number.
It is a super-2 number, since 2×101511634403642 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10316222517 + ... + 10316223500.
It is an arithmetic number, because the mean of its divisors is an integer number (1010989854882).
Almost surely, 210151163440364 is an apocalyptic number.
It is an amenable number.
10151163440364 is an abundant number, since it is smaller than the sum of its proper divisors (14112593076804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10151163440364 is a wasteful number, since it uses less digits than its factorization.
10151163440364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20632446065 (or 20632446063 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 39.
Adding to 10151163440364 its reverse (46304436115101), we get a palindrome (56455599555465).
The spelling of 10151163440364 in words is "ten trillion, one hundred fifty-one billion, one hundred sixty-three million, four hundred forty thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •