Base | Representation |
---|---|
bin | 101111001000010010… |
… | …1101000010100110101 |
3 | 100200020111112022021222 |
4 | 1132100211220110311 |
5 | 3124234232001123 |
6 | 114254550120125 |
7 | 10212036033611 |
oct | 1362045502465 |
9 | 320214468258 |
10 | 101210031413 |
11 | 39a17473667 |
12 | 17747050045 |
13 | 970c406b6a |
14 | 4c81a42341 |
15 | 29755a76c8 |
hex | 1790968535 |
101210031413 has 8 divisors (see below), whose sum is σ = 104495010816. Its totient is φ = 97926310800.
The previous prime is 101210031409. The next prime is 101210031431. The reversal of 101210031413 is 314130012101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101210031413 - 22 = 101210031409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101210031391 and 101210031400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101210031463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 149906 + ... + 474227.
It is an arithmetic number, because the mean of its divisors is an integer number (13061876352).
Almost surely, 2101210031413 is an apocalyptic number.
It is an amenable number.
101210031413 is a deficient number, since it is larger than the sum of its proper divisors (3284979403).
101210031413 is an equidigital number, since it uses as much as digits as its factorization.
101210031413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 629395.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101210031413 its reverse (314130012101), we get a palindrome (415340043514).
The spelling of 101210031413 in words is "one hundred one billion, two hundred ten million, thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •