Base | Representation |
---|---|
bin | 10111000011111000111001… |
… | …011010101101001111110100 |
3 | 111022002212201221021010210021 |
4 | 113003320321122231033310 |
5 | 101243200403140431012 |
6 | 555412434314334524 |
7 | 30235343443340014 |
oct | 2703707132551764 |
9 | 438085657233707 |
10 | 101422321030132 |
11 | 2a352a68168803 |
12 | b4603aa12a444 |
13 | 4479112253b4b |
14 | 1b08c1ba87c44 |
15 | bad362323007 |
hex | 5c3e396ad3f4 |
101422321030132 has 24 divisors (see below), whose sum is σ = 179490474132480. Its totient is φ = 50139373838400.
The previous prime is 101422321030117. The next prime is 101422321030139. The reversal of 101422321030132 is 231030123224101.
It is a junction number, because it is equal to n+sod(n) for n = 101422321030097 and 101422321030106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101422321030139) 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, 3287757 + ... + 14616907.
It is an arithmetic number, because the mean of its divisors is an integer number (7478769755520).
Almost surely, 2101422321030132 is an apocalyptic number.
It is an amenable number.
101422321030132 is a deficient number, since it is larger than the sum of its proper divisors (78068153102348).
101422321030132 is a wasteful number, since it uses less digits than its factorization.
101422321030132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11354391 (or 11354389 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 101422321030132 its reverse (231030123224101), we get a palindrome (332452444254233).
The spelling of 101422321030132 in words is "one hundred one trillion, four hundred twenty-two billion, three hundred twenty-one million, thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •