Base | Representation |
---|---|
bin | 1011001001011011101000… |
… | …1111000111101110001101 |
3 | 1121101201121010212002121120 |
4 | 2302112322033013232031 |
5 | 3101303123023041303 |
6 | 42022345033551153 |
7 | 2403341420625153 |
oct | 262267217075615 |
9 | 47351533762546 |
10 | 12256666221453 |
11 | 39a6028607985 |
12 | 145b5108754b9 |
13 | 6aba4c88aac4 |
14 | 3053238a33d3 |
15 | 163c560c1553 |
hex | b25ba3c7b8d |
12256666221453 has 4 divisors (see below), whose sum is σ = 16342221628608. Its totient is φ = 8171110814300.
The previous prime is 12256666221433. The next prime is 12256666221523. The reversal of 12256666221453 is 35412266665221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12256666221453 - 212 = 12256666217357 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12256666221396 and 12256666221405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12256666221433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2042777703573 + ... + 2042777703578.
It is an arithmetic number, because the mean of its divisors is an integer number (4085555407152).
Almost surely, 212256666221453 is an apocalyptic number.
It is an amenable number.
12256666221453 is a deficient number, since it is larger than the sum of its proper divisors (4085555407155).
12256666221453 is an equidigital number, since it uses as much as digits as its factorization.
12256666221453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4085555407154.
The product of its digits is 6220800, while the sum is 51.
The spelling of 12256666221453 in words is "twelve trillion, two hundred fifty-six billion, six hundred sixty-six million, two hundred twenty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •