Base | Representation |
---|---|
bin | 11010001011010001001011… |
… | …001101011010101101010010 |
3 | 120002121201001012101222100012 |
4 | 122023101023031122231102 |
5 | 110042141030143213300 |
6 | 1044503011415354522 |
7 | 33151255160321666 |
oct | 3213211315325522 |
9 | 502551035358305 |
10 | 115123565210450 |
11 | 337556a2329195 |
12 | 10ab3875082a42 |
13 | 4c3114b06bb64 |
14 | 20600203248a6 |
15 | d49964dc8435 |
hex | 68b44b35ab52 |
115123565210450 has 96 divisors (see below), whose sum is σ = 216952207920000. Its totient is φ = 45443737912320.
The previous prime is 115123565210429. The next prime is 115123565210473. The reversal of 115123565210450 is 54012565321511.
It is a junction number, because it is equal to n+sod(n) for n = 115123565210398 and 115123565210407.
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 47 ways as a sum of consecutive naturals, for example, 26028386939 + ... + 26028391361.
It is an arithmetic number, because the mean of its divisors is an integer number (2259918832500).
Almost surely, 2115123565210450 is an apocalyptic number.
115123565210450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115123565210450 is a deficient number, since it is larger than the sum of its proper divisors (101828642709550).
115123565210450 is a wasteful number, since it uses less digits than its factorization.
115123565210450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10116 (or 10111 counting only the distinct ones).
The product of its (nonzero) digits is 180000, while the sum is 41.
The spelling of 115123565210450 in words is "one hundred fifteen trillion, one hundred twenty-three billion, five hundred sixty-five million, two hundred ten thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •