Base | Representation |
---|---|
bin | 101111001110000000… |
… | …1111011111110110011 |
3 | 100200201212202101111221 |
4 | 1132130001323332303 |
5 | 3130132403020311 |
6 | 114330004445511 |
7 | 10216556534641 |
oct | 1363401737663 |
9 | 320655671457 |
10 | 101402001331 |
11 | 3a005871494 |
12 | 1779b3a9897 |
13 | 974010c127 |
14 | 4c9d334191 |
15 | 2987377671 |
hex | 179c07bfb3 |
101402001331 has 12 divisors (see below), whose sum is σ = 104840733456. Its totient is φ = 98072733360.
The previous prime is 101402001317. The next prime is 101402001359. The reversal of 101402001331 is 133100204101.
It is not a de Polignac number, because 101402001331 - 25 = 101402001299 is a prime.
It is a super-2 number, since 2×1014020013312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101402001301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1634970 + ... + 1695856.
It is an arithmetic number, because the mean of its divisors is an integer number (8736727788).
Almost surely, 2101402001331 is an apocalyptic number.
101402001331 is a deficient number, since it is larger than the sum of its proper divisors (3438732125).
101402001331 is an equidigital number, since it uses as much as digits as its factorization.
101402001331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62682 (or 62651 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101402001331 its reverse (133100204101), we get a palindrome (234502205432).
The spelling of 101402001331 in words is "one hundred one billion, four hundred two million, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •