Base | Representation |
---|---|
bin | 101111001011100101… |
… | …0110001111100010111 |
3 | 100200112012021022101121 |
4 | 1132113022301330113 |
5 | 3130001012332211 |
6 | 114313532304411 |
7 | 10214546321440 |
oct | 1362712617427 |
9 | 320465238347 |
10 | 101320433431 |
11 | 39a7381a2a8 |
12 | 17778012107 |
13 | 97292501b9 |
14 | 4c925802c7 |
15 | 2980114271 |
hex | 17972b1f17 |
101320433431 has 8 divisors (see below), whose sum is σ = 115848983840. Its totient is φ = 86805433728.
The previous prime is 101320433419. The next prime is 101320433471. The reversal of 101320433431 is 134334023101.
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 101320433431 - 25 = 101320433399 is a prime.
It is a super-2 number, since 2×1013204334312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101320433396 and 101320433405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101320433471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3371646 + ... + 3401563.
It is an arithmetic number, because the mean of its divisors is an integer number (14481122980).
Almost surely, 2101320433431 is an apocalyptic number.
101320433431 is a deficient number, since it is larger than the sum of its proper divisors (14528550409).
101320433431 is an equidigital number, since it uses as much as digits as its factorization.
101320433431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6775353.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 101320433431 its reverse (134334023101), we get a palindrome (235654456532).
The spelling of 101320433431 in words is "one hundred one billion, three hundred twenty million, four hundred thirty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •