Base | Representation |
---|---|
bin | 1001001110111000000001… |
… | …1101110100010101100001 |
3 | 1022221102221000010100002111 |
4 | 2103232000131310111201 |
5 | 2312304040213130031 |
6 | 33331214021115321 |
7 | 2065253165666266 |
oct | 223560035642541 |
9 | 38842830110074 |
10 | 10151163020641 |
11 | 32640a1980855 |
12 | 117b443b58b41 |
13 | 588334652476 |
14 | 27146714526d |
15 | 1290c5ba61b1 |
hex | 93b80774561 |
10151163020641 has 8 divisors (see below), whose sum is σ = 10165469932800. Its totient is φ = 10136863199520.
The previous prime is 10151163020633. The next prime is 10151163020693. The reversal of 10151163020641 is 14602036115101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10151163020641 - 23 = 10151163020633 is a prime.
It is a super-2 number, since 2×101511630206412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10151163020441) 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, 1095621 + ... + 4637101.
It is an arithmetic number, because the mean of its divisors is an integer number (1270683741600).
Almost surely, 210151163020641 is an apocalyptic number.
It is an amenable number.
10151163020641 is a deficient number, since it is larger than the sum of its proper divisors (14306912159).
10151163020641 is an equidigital number, since it uses as much as digits as its factorization.
10151163020641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3545519.
The product of its (nonzero) digits is 4320, while the sum is 31.
Adding to 10151163020641 its reverse (14602036115101), we get a palindrome (24753199135742).
The spelling of 10151163020641 in words is "ten trillion, one hundred fifty-one billion, one hundred sixty-three million, twenty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •