Base | Representation |
---|---|
bin | 10111000101011000… |
… | …00110001110011101 |
3 | 1011222200220000020110 |
4 | 23202230012032131 |
5 | 200340121121440 |
6 | 5405432040233 |
7 | 616053665535 |
oct | 134254061635 |
9 | 34880800213 |
10 | 12393145245 |
11 | 528a6754a8 |
12 | 249a533079 |
13 | 1226746050 |
14 | 857d1a4c5 |
15 | 4c802d080 |
hex | 2e2b0639d |
12393145245 has 32 divisors (see below), whose sum is σ = 21375244800. Its totient is φ = 6095268864.
The previous prime is 12393145229. The next prime is 12393145277. The reversal of 12393145245 is 54254139321.
12393145245 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12393145245 - 24 = 12393145229 is a prime.
It is a super-2 number, since 2×123931452452 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 172021 + ... + 233189.
It is an arithmetic number, because the mean of its divisors is an integer number (667976400).
Almost surely, 212393145245 is an apocalyptic number.
12393145245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12393145245 is a deficient number, since it is larger than the sum of its proper divisors (8982099555).
12393145245 is a wasteful number, since it uses less digits than its factorization.
12393145245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62229.
The product of its digits is 129600, while the sum is 39.
The spelling of 12393145245 in words is "twelve billion, three hundred ninety-three million, one hundred forty-five thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •