Base | Representation |
---|---|
bin | 1011001001010001111000… |
… | …0011111101101011100011 |
3 | 1121101110211112112122112001 |
4 | 2302110132003331223203 |
5 | 3101232241242113133 |
6 | 42021233034344431 |
7 | 2403216453555316 |
oct | 262243603755343 |
9 | 47343745478461 |
10 | 12254046051043 |
11 | 39a4a03596095 |
12 | 145aabb28b117 |
13 | 6ab722aa5004 |
14 | 3051558d097d |
15 | 163b5105987d |
hex | b251e0fdae3 |
12254046051043 has 4 divisors (see below), whose sum is σ = 12254053631440. Its totient is φ = 12254038470648.
The previous prime is 12254046051019. The next prime is 12254046051073. The reversal of 12254046051043 is 34015064045221.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 12254046051043 - 25 = 12254046051011 is a prime.
It is a super-2 number, since 2×122540460510432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12254046050993 and 12254046051011.
It is not an unprimeable number, because it can be changed into a prime (12254046051073) 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, 284580 + ... + 4958737.
It is an arithmetic number, because the mean of its divisors is an integer number (3063513407860).
Almost surely, 212254046051043 is an apocalyptic number.
12254046051043 is a deficient number, since it is larger than the sum of its proper divisors (7580397).
12254046051043 is an equidigital number, since it uses as much as digits as its factorization.
12254046051043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7580396.
The product of its (nonzero) digits is 115200, while the sum is 37.
The spelling of 12254046051043 in words is "twelve trillion, two hundred fifty-four billion, forty-six million, fifty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •