Base | Representation |
---|---|
bin | 1010111101000000000011… |
… | …0000111000100010000111 |
3 | 1120122022100102102110211210 |
4 | 2233100000300320202013 |
5 | 3034303232341044310 |
6 | 41340305124302503 |
7 | 2352041162303340 |
oct | 257200060704207 |
9 | 46568312373753 |
10 | 12043101112455 |
11 | 39234a56845a6 |
12 | 142604a241a33 |
13 | 69487609961a |
14 | 2d8c63d930c7 |
15 | 15d406cc0820 |
hex | af400c38887 |
12043101112455 has 64 divisors (see below), whose sum is σ = 22062529317888. Its totient is φ = 5495208099840.
The previous prime is 12043101112409. The next prime is 12043101112477. The reversal of 12043101112455 is 55421110134021.
It is not a de Polignac number, because 12043101112455 - 28 = 12043101112199 is a prime.
It is a super-2 number, since 2×120431011124552 (a number of 27 digits) contains 22 as substring.
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 63 ways as a sum of consecutive naturals, for example, 245167557 + ... + 245216673.
It is an arithmetic number, because the mean of its divisors is an integer number (344727020592).
Almost surely, 212043101112455 is an apocalyptic number.
12043101112455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
12043101112455 is a deficient number, since it is larger than the sum of its proper divisors (10019428205433).
12043101112455 is a wasteful number, since it uses less digits than its factorization.
12043101112455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53416.
The product of its (nonzero) digits is 4800, while the sum is 30.
Adding to 12043101112455 its reverse (55421110134021), we get a palindrome (67464211246476).
The spelling of 12043101112455 in words is "twelve trillion, forty-three billion, one hundred one million, one hundred twelve thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •