Base | Representation |
---|---|
bin | 10010110100001010… |
… | …00110011010100111 |
3 | 222001222020012021110 |
4 | 21122011012122213 |
5 | 131141403033111 |
6 | 4350200120103 |
7 | 505213650666 |
oct | 113205063247 |
9 | 28058205243 |
10 | 10101221031 |
11 | 431396a960 |
12 | 1b5aa66033 |
13 | c4c96a985 |
14 | 6bb790ddd |
15 | 3e1c045a6 |
hex | 25a1466a7 |
10101221031 has 64 divisors (see below), whose sum is σ = 15369209856. Its totient is φ = 5847811200.
The previous prime is 10101221027. The next prime is 10101221033. The reversal of 10101221031 is 13012210101.
It is not a de Polignac number, because 10101221031 - 22 = 10101221027 is a prime.
It is a super-2 number, since 2×101012210312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10101220998 and 10101221016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101221033) 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, 17207920 + ... + 17208506.
It is an arithmetic number, because the mean of its divisors is an integer number (240143904).
Almost surely, 210101221031 is an apocalyptic number.
10101221031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10101221031 is a deficient number, since it is larger than the sum of its proper divisors (5267988825).
10101221031 is a wasteful number, since it uses less digits than its factorization.
10101221031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 892.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 10101221031 its reverse (13012210101), we get a palindrome (23113431132).
It can be divided in two parts, 10101 and 221031, that added together give a palindrome (231132).
The spelling of 10101221031 in words is "ten billion, one hundred one million, two hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •