Base | Representation |
---|---|
bin | 1011000001001001000110… |
… | …1010100111110110011011 |
3 | 1120220010000000200222201111 |
4 | 2300102101222213312123 |
5 | 3041434441410104230 |
6 | 41433113235201151 |
7 | 2360140306660312 |
oct | 260222152476633 |
9 | 46803000628644 |
10 | 12114251644315 |
11 | 3950697265247 |
12 | 14379a64461b7 |
13 | 69b4a49a8152 |
14 | 2dc4936dd279 |
15 | 1601bd3e992a |
hex | b0491aa7d9b |
12114251644315 has 8 divisors (see below), whose sum is σ = 14602290772608. Its totient is φ = 9647942115840.
The previous prime is 12114251644307. The next prime is 12114251644331. The reversal of 12114251644315 is 51344615241121.
12114251644315 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12114251644315 - 23 = 12114251644307 is a prime.
It is a super-3 number, since 3×121142516443153 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5432398726 + ... + 5432400955.
It is an arithmetic number, because the mean of its divisors is an integer number (1825286346576).
Almost surely, 212114251644315 is an apocalyptic number.
12114251644315 is a deficient number, since it is larger than the sum of its proper divisors (2488039128293).
12114251644315 is a wasteful number, since it uses less digits than its factorization.
12114251644315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10864799909.
The product of its digits is 115200, while the sum is 40.
Adding to 12114251644315 its reverse (51344615241121), we get a palindrome (63458866885436).
The spelling of 12114251644315 in words is "twelve trillion, one hundred fourteen billion, two hundred fifty-one million, six hundred forty-four thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •