Base | Representation |
---|---|
bin | 101111001000111001… |
… | …1011000001010001111 |
3 | 100200021220212202210111 |
4 | 1132101303120022033 |
5 | 3124304441144211 |
6 | 114300555020451 |
7 | 10212404210521 |
oct | 1362163301217 |
9 | 320256782714 |
10 | 101230412431 |
11 | 39a27a24185 |
12 | 17751a3a727 |
13 | 97136c1835 |
14 | 4c84629a11 |
15 | 2977281421 |
hex | 1791cd828f |
101230412431 has 8 divisors (see below), whose sum is σ = 107187935904. Its totient is φ = 95273199360.
The previous prime is 101230412419. The next prime is 101230412471. The reversal of 101230412431 is 134214032101.
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 101230412431 - 211 = 101230410383 is a prime.
It is a super-2 number, since 2×1012304124312 (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 (101230412401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1138326 + ... + 1224028.
It is an arithmetic number, because the mean of its divisors is an integer number (13398491988).
Almost surely, 2101230412431 is an apocalyptic number.
101230412431 is a deficient number, since it is larger than the sum of its proper divisors (5957523473).
101230412431 is an equidigital number, since it uses as much as digits as its factorization.
101230412431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155201.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 101230412431 its reverse (134214032101), we get a palindrome (235444444532).
The spelling of 101230412431 in words is "one hundred one billion, two hundred thirty million, four hundred twelve thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •