Base | Representation |
---|---|
bin | 1011001001010101101010… |
… | …0011101111011100101001 |
3 | 1121101120110021101010101021 |
4 | 2302111122203233130221 |
5 | 3101241331104424223 |
6 | 42021521452452441 |
7 | 2403253556610025 |
oct | 262253243573451 |
9 | 47346407333337 |
10 | 12255061014313 |
11 | 39a53844aa007 |
12 | 145b14317a121 |
13 | 6ab855150bb0 |
14 | 305210615385 |
15 | 163bb01e465d |
hex | b255a8ef729 |
12255061014313 has 8 divisors (see below), whose sum is σ = 13234520577600. Its totient is φ = 11280853245648.
The previous prime is 12255061014311. The next prime is 12255061014347. The reversal of 12255061014313 is 31341016055221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12255061014313 - 21 = 12255061014311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12255061014311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1312943803 + ... + 1312953136.
It is an arithmetic number, because the mean of its divisors is an integer number (1654315072200).
Almost surely, 212255061014313 is an apocalyptic number.
12255061014313 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12255061014313 is a deficient number, since it is larger than the sum of its proper divisors (979459563287).
12255061014313 is a wasteful number, since it uses less digits than its factorization.
12255061014313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2625897311.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 12255061014313 its reverse (31341016055221), we get a palindrome (43596077069534).
The spelling of 12255061014313 in words is "twelve trillion, two hundred fifty-five billion, sixty-one million, fourteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •