Base | Representation |
---|---|
bin | 10111000011100100011010… |
… | …101110111110001000110110 |
3 | 111022000202222102220210120220 |
4 | 113003210122232332020312 |
5 | 101242320334320141042 |
6 | 555354400312435210 |
7 | 30233634511561146 |
oct | 2703443256761066 |
9 | 438022872823526 |
10 | 101400331412022 |
11 | 2a3447036431a5 |
12 | b4580919a8b06 |
13 | 44770195c84b6 |
14 | 1b07b3344a926 |
15 | bac9c6a958ec |
hex | 5c391abbe236 |
101400331412022 has 32 divisors (see below), whose sum is σ = 203475518880000. Its totient is φ = 33687813424608.
The previous prime is 101400331411937. The next prime is 101400331412027. The reversal of 101400331412022 is 220214133004101.
It is a super-2 number, since 2×1014003314120222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101400331411983 and 101400331412001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101400331412027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20103322 + ... + 24636237.
It is an arithmetic number, because the mean of its divisors is an integer number (6358609965000).
Almost surely, 2101400331412022 is an apocalyptic number.
101400331412022 is an abundant number, since it is smaller than the sum of its proper divisors (102075187467978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101400331412022 is a wasteful number, since it uses less digits than its factorization.
101400331412022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44740820.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 101400331412022 its reverse (220214133004101), we get a palindrome (321614464416123).
The spelling of 101400331412022 in words is "one hundred one trillion, four hundred billion, three hundred thirty-one million, four hundred twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •