Base | Representation |
---|---|
bin | 10010111010101111010… |
… | …110110000010011011100 |
3 | 11121021120202221022101120 |
4 | 102322233112300103130 |
5 | 132244421124214322 |
6 | 2433115533210540 |
7 | 162631521351402 |
oct | 22725726602334 |
9 | 4537522838346 |
10 | 1300022101212 |
11 | 46137764815a |
12 | 18bb52930a50 |
13 | 9578c865093 |
14 | 46cc849d472 |
15 | 23c3ad3da5c |
hex | 12eaf5b04dc |
1300022101212 has 48 divisors (see below), whose sum is σ = 3067770625920. Its totient is φ = 428445484992.
The previous prime is 1300022101211. The next prime is 1300022101241. The reversal of 1300022101212 is 2121012200031.
It is a junction number, because it is equal to n+sod(n) for n = 1300022101191 and 1300022101200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300022101211) 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, 453298 + ... + 1674969.
It is an arithmetic number, because the mean of its divisors is an integer number (63911888040).
Almost surely, 21300022101212 is an apocalyptic number.
1300022101212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1300022101212 is an abundant number, since it is smaller than the sum of its proper divisors (1767748524708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1300022101212 is a wasteful number, since it uses less digits than its factorization.
1300022101212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2128850 (or 2128848 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1300022101212 its reverse (2121012200031), we get a palindrome (3421034301243).
The spelling of 1300022101212 in words is "one trillion, three hundred billion, twenty-two million, one hundred one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •