Base | Representation |
---|---|
bin | 1101101100000101110001… |
… | …1011000011110010111010 |
3 | 1222021212120011010100110222 |
4 | 3123001130123003302322 |
5 | 3433044141144034430 |
6 | 52002215350540042 |
7 | 3112256454064661 |
oct | 333013433036272 |
9 | 58255504110428 |
10 | 15051116002490 |
11 | 4883162668837 |
12 | 1831010367622 |
13 | 852411253bb9 |
14 | 3a069950bdd8 |
15 | 1b17a9ea19e5 |
hex | db05c6c3cba |
15051116002490 has 32 divisors (see below), whose sum is σ = 27409422733056. Its totient is φ = 5950142386560.
The previous prime is 15051116002487. The next prime is 15051116002529. The reversal of 15051116002490 is 9420061115051.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 15051116002490.
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, 14007491 + ... + 15043670.
It is an arithmetic number, because the mean of its divisors is an integer number (856544460408).
Almost surely, 215051116002490 is an apocalyptic number.
15051116002490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15051116002490 is a deficient number, since it is larger than the sum of its proper divisors (12358306730566).
15051116002490 is a wasteful number, since it uses less digits than its factorization.
15051116002490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29051774.
The product of its (nonzero) digits is 10800, while the sum is 35.
The spelling of 15051116002490 in words is "fifteen trillion, fifty-one billion, one hundred sixteen million, two thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •