Base | Representation |
---|---|
bin | 1010111011001000111011… |
… | …0111001110111100111111 |
3 | 1120112020210222111011020021 |
4 | 2232302032313032330333 |
5 | 3033242241100402310 |
6 | 41313500154033011 |
7 | 2346526612253053 |
oct | 256621667167477 |
9 | 46466728434207 |
10 | 12011125403455 |
11 | 3910987185112 |
12 | 141ba05718767 |
13 | 69184b5b3759 |
14 | 2d74ad3b3c63 |
15 | 15c6849d15da |
hex | aec8edcef3f |
12011125403455 has 8 divisors (see below), whose sum is σ = 14413666556304. Its totient is φ = 9608689608000.
The previous prime is 12011125403447. The next prime is 12011125403509. The reversal of 12011125403455 is 55430452111021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12011125403455 - 23 = 12011125403447 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12011125403455.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26088321 + ... + 26544730.
It is an arithmetic number, because the mean of its divisors is an integer number (1801708319538).
Almost surely, 212011125403455 is an apocalyptic number.
12011125403455 is a deficient number, since it is larger than the sum of its proper divisors (2402541152849).
12011125403455 is an equidigital number, since it uses as much as digits as its factorization.
12011125403455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52678697.
The product of its (nonzero) digits is 24000, while the sum is 34.
Adding to 12011125403455 its reverse (55430452111021), we get a palindrome (67441577514476).
The spelling of 12011125403455 in words is "twelve trillion, eleven billion, one hundred twenty-five million, four hundred three thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •