Base | Representation |
---|---|
bin | 101111010100010100… |
… | …1010100110000100111 |
3 | 100201021122000102001210 |
4 | 1132220221110300213 |
5 | 3131101043344111 |
6 | 114403005122503 |
7 | 10225036541202 |
oct | 1365051246047 |
9 | 321248012053 |
10 | 101613653031 |
11 | 3a104292550 |
12 | 1783a259433 |
13 | 9774c15a17 |
14 | 4cbd4aa939 |
15 | 299ac340a6 |
hex | 17a8a54c27 |
101613653031 has 32 divisors (see below), whose sum is σ = 148285437696. Its totient is φ = 61382720000.
The previous prime is 101613652991. The next prime is 101613653033. The reversal of 101613653031 is 130356316101.
It is a cyclic number.
It is not a de Polignac number, because 101613653031 - 26 = 101613652967 is a prime.
It is a super-2 number, since 2×1016136530312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101613653031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101613653033) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24836296 + ... + 24840386.
It is an arithmetic number, because the mean of its divisors is an integer number (4633919928).
Almost surely, 2101613653031 is an apocalyptic number.
101613653031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101613653031 is a deficient number, since it is larger than the sum of its proper divisors (46671784665).
101613653031 is a wasteful number, since it uses less digits than its factorization.
101613653031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6383.
The product of its (nonzero) digits is 4860, while the sum is 30.
Adding to 101613653031 its reverse (130356316101), we get a palindrome (231969969132).
The spelling of 101613653031 in words is "one hundred one billion, six hundred thirteen million, six hundred fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •