Base | Representation |
---|---|
bin | 10111010010010111… |
… | …11011001000001010 |
3 | 1012021022000002222012 |
4 | 23221023323020022 |
5 | 201101022323230 |
6 | 5424324255522 |
7 | 621546351560 |
oct | 135113731012 |
9 | 35238002865 |
10 | 12502151690 |
11 | 5336158676 |
12 | 250ab415a2 |
13 | 12431c10c2 |
14 | 8685b3a30 |
15 | 4d28b1395 |
hex | 2e92fb20a |
12502151690 has 32 divisors (see below), whose sum is σ = 25722817920. Its totient is φ = 4285767744.
The previous prime is 12502151587. The next prime is 12502151719. The reversal of 12502151690 is 9615120521.
12502151690 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×125021516902 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 640901 + ... + 660119.
It is an arithmetic number, because the mean of its divisors is an integer number (803838060).
Almost surely, 212502151690 is an apocalyptic number.
12502151690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12502151690 is an abundant number, since it is smaller than the sum of its proper divisors (13220666230).
12502151690 is a wasteful number, since it uses less digits than its factorization.
12502151690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28526.
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 12502151690 in words is "twelve billion, five hundred two million, one hundred fifty-one thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •