Base | Representation |
---|---|
bin | 101110101000001010… |
… | …1101110101010001111 |
3 | 100120110101020210111122 |
4 | 1131100111232222033 |
5 | 3120032310334411 |
6 | 114000002511155 |
7 | 10143236662412 |
oct | 1352025565217 |
9 | 316411223448 |
10 | 100132121231 |
11 | 39513a767aa |
12 | 174a60654bb |
13 | 9599cbb89c |
14 | 4bbc813b79 |
15 | 2910b369db |
hex | 175056ea8f |
100132121231 has 4 divisors (see below), whose sum is σ = 100176176352. Its totient is φ = 100088066112.
The previous prime is 100132121213. The next prime is 100132121263. The reversal of 100132121231 is 132121231001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132121231001 = 257 ⋅514090393.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100132121231 is a prime.
It is a super-2 number, since 2×1001321212312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100132121731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22024151 + ... + 22028696.
It is an arithmetic number, because the mean of its divisors is an integer number (25044044088).
Almost surely, 2100132121231 is an apocalyptic number.
100132121231 is a deficient number, since it is larger than the sum of its proper divisors (44055121).
100132121231 is an equidigital number, since it uses as much as digits as its factorization.
100132121231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44055120.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 100132121231 its reverse (132121231001), we get a palindrome (232253352232).
The spelling of 100132121231 in words is "one hundred billion, one hundred thirty-two million, one hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •