Base | Representation |
---|---|
bin | 10010110100001001… |
… | …01100010100010100 |
3 | 222001222000202122020 |
4 | 21122010230110110 |
5 | 131141341123012 |
6 | 4350153533140 |
7 | 505213024224 |
oct | 113204542424 |
9 | 28058022566 |
10 | 10101114132 |
11 | 43138a760a |
12 | 1b5aa141b0 |
13 | c4c931115 |
14 | 6bb764084 |
15 | 3e1bd2a8c |
hex | 25a12c514 |
10101114132 has 24 divisors (see below), whose sum is σ = 23654361696. Its totient is φ = 3354881568.
The previous prime is 10101114113. The next prime is 10101114137. The reversal of 10101114132 is 23141110101.
It is a super-2 number, since 2×101011141322 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101114137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1516098 + ... + 1522745.
It is an arithmetic number, because the mean of its divisors is an integer number (985598404).
Almost surely, 210101114132 is an apocalyptic number.
10101114132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10101114132 is an abundant number, since it is smaller than the sum of its proper divisors (13553247564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10101114132 is a wasteful number, since it uses less digits than its factorization.
10101114132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3039127 (or 3039125 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 10101114132 its reverse (23141110101), we get a palindrome (33242224233).
The spelling of 10101114132 in words is "ten billion, one hundred one million, one hundred fourteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •