Base | Representation |
---|---|
bin | 1011010101101001000101… |
… | …1100010110101000100011 |
3 | 1122010210001022020102121221 |
4 | 2311122101130112220203 |
5 | 3113222224404101201 |
6 | 42303000135355511 |
7 | 2424445612666366 |
oct | 265322134265043 |
9 | 48123038212557 |
10 | 12466435222051 |
11 | 3a76a92757898 |
12 | 14940b3b22b97 |
13 | 6c576ca782b5 |
14 | 3115431760dd |
15 | 169431ec44a1 |
hex | b5691716a23 |
12466435222051 has 4 divisors (see below), whose sum is σ = 12582943962552. Its totient is φ = 12349926481552.
The previous prime is 12466435221979. The next prime is 12466435222057. The reversal of 12466435222051 is 15022253466421.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12466435222051 - 219 = 12466434697763 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12466435221989 and 12466435222007.
It is not an unprimeable number, because it can be changed into a prime (12466435222057) 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, 58254370090 + ... + 58254370303.
It is an arithmetic number, because the mean of its divisors is an integer number (3145735990638).
Almost surely, 212466435222051 is an apocalyptic number.
12466435222051 is a deficient number, since it is larger than the sum of its proper divisors (116508740501).
12466435222051 is a wasteful number, since it uses less digits than its factorization.
12466435222051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116508740500.
The product of its (nonzero) digits is 691200, while the sum is 43.
Adding to 12466435222051 its reverse (15022253466421), we get a palindrome (27488688688472).
The spelling of 12466435222051 in words is "twelve trillion, four hundred sixty-six billion, four hundred thirty-five million, two hundred twenty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •