Base | Representation |
---|---|
bin | 101111000010101001… |
… | …0010111110000010111 |
3 | 100122202021202201202111 |
4 | 1132011102113300113 |
5 | 3123342212332211 |
6 | 114224054251451 |
7 | 10204244342041 |
oct | 1360522276027 |
9 | 318667681674 |
10 | 101020433431 |
11 | 3992a445915 |
12 | 176b3656b87 |
13 | 96ac0523c8 |
14 | 4c647aaa91 |
15 | 2963b05421 |
hex | 1785497c17 |
101020433431 has 8 divisors (see below), whose sum is σ = 101553328800. Its totient is φ = 100487791008.
The previous prime is 101020433413. The next prime is 101020433447. The reversal of 101020433431 is 134334020101.
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 101020433431 - 223 = 101012044823 is a prime.
It is a super-2 number, since 2×1010204334312 (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 (101020433401) 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, 766185 + ... + 888301.
It is an arithmetic number, because the mean of its divisors is an integer number (12694166100).
Almost surely, 2101020433431 is an apocalyptic number.
101020433431 is a deficient number, since it is larger than the sum of its proper divisors (532895369).
101020433431 is a wasteful number, since it uses less digits than its factorization.
101020433431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126473.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 101020433431 its reverse (134334020101), we get a palindrome (235354453532).
The spelling of 101020433431 in words is "one hundred one billion, twenty million, four hundred thirty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •