Base | Representation |
---|---|
bin | 11010010000111110001001… |
… | …011100101011001011100100 |
3 | 120011000011120102110011012220 |
4 | 122100332021130223023210 |
5 | 110120101121030441122 |
6 | 1045403022113112340 |
7 | 33221500400210250 |
oct | 3220761134531344 |
9 | 504004512404186 |
10 | 115515451421412 |
11 | 33896911933809 |
12 | 10b57802b586b0 |
13 | 4c5c0a27061a3 |
14 | 2074d98a7d260 |
15 | d54c4e2eb25c |
hex | 690f8972b2e4 |
115515451421412 has 48 divisors (see below), whose sum is σ = 311752543613952. Its totient is φ = 32606771139360.
The previous prime is 115515451421269. The next prime is 115515451421431. The reversal of 115515451421412 is 214124154515511.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8284233664 + ... + 8284247607.
It is an arithmetic number, because the mean of its divisors is an integer number (6494844658624).
Almost surely, 2115515451421412 is an apocalyptic number.
115515451421412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
115515451421412 is an abundant number, since it is smaller than the sum of its proper divisors (196237092192540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115515451421412 is a wasteful number, since it uses less digits than its factorization.
115515451421412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16568481368 (or 16568481366 counting only the distinct ones).
The product of its digits is 160000, while the sum is 42.
The spelling of 115515451421412 in words is "one hundred fifteen trillion, five hundred fifteen billion, four hundred fifty-one million, four hundred twenty-one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •