Base | Representation |
---|---|
bin | 1001001100110010111111… |
… | …0111110100000001000100 |
3 | 1022211000202011220221112110 |
4 | 2103030233313310001010 |
5 | 2311212420443022322 |
6 | 33302550223421020 |
7 | 2062550211016533 |
oct | 223145767640104 |
9 | 38730664827473 |
10 | 10115451142212 |
11 | 324aa36507a39 |
12 | 1174538154770 |
13 | 584b62ac0860 |
14 | 26d83a28c31a |
15 | 1281d58a8c0c |
hex | 9332fdf4044 |
10115451142212 has 48 divisors (see below), whose sum is σ = 25442091200960. Its totient is φ = 3109534904448.
The previous prime is 10115451142211. The next prime is 10115451142231. The reversal of 10115451142212 is 21224115451101.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 10115451142212.
It is not an unprimeable number, because it can be changed into a prime (10115451142211) 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, 30161878 + ... + 30495405.
Almost surely, 210115451142212 is an apocalyptic number.
10115451142212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10115451142212 is an abundant number, since it is smaller than the sum of its proper divisors (15326640058748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10115451142212 is a wasteful number, since it uses less digits than its factorization.
10115451142212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60658372 (or 60658370 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 30.
Adding to 10115451142212 its reverse (21224115451101), we get a palindrome (31339566593313).
The spelling of 10115451142212 in words is "ten trillion, one hundred fifteen billion, four hundred fifty-one million, one hundred forty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •