Base | Representation |
---|---|
bin | 101111001110111100… |
… | …1110010110110101111 |
3 | 100200211001212200111221 |
4 | 1132131321302312233 |
5 | 3130213423434411 |
6 | 114333050124211 |
7 | 10220420566102 |
oct | 1363571626657 |
9 | 320731780457 |
10 | 101433421231 |
11 | 3a02158174a |
12 | 177a9a20667 |
13 | 974679049c |
14 | 4ca3592739 |
15 | 2989ed2071 |
hex | 179de72daf |
101433421231 has 4 divisors (see below), whose sum is σ = 103096264264. Its totient is φ = 99770578200.
The previous prime is 101433421169. The next prime is 101433421259. The reversal of 101433421231 is 132124334101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101433421231 - 227 = 101299203503 is a prime.
It is a super-2 number, since 2×1014334212312 (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 = 101433421196 and 101433421205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101433461231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 831421425 + ... + 831421546.
It is an arithmetic number, because the mean of its divisors is an integer number (25774066066).
Almost surely, 2101433421231 is an apocalyptic number.
101433421231 is a deficient number, since it is larger than the sum of its proper divisors (1662843033).
101433421231 is an equidigital number, since it uses as much as digits as its factorization.
101433421231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1662843032.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 101433421231 its reverse (132124334101), we get a palindrome (233557755332).
The spelling of 101433421231 in words is "one hundred one billion, four hundred thirty-three million, four hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •