Base | Representation |
---|---|
bin | 1001010011000101111001… |
… | …1011100101000110110000 |
3 | 1100012100220201012222120010 |
4 | 2110301132123211012300 |
5 | 2320000421222441111 |
6 | 33424354315214520 |
7 | 2103426333003402 |
oct | 224613633450660 |
9 | 40170821188503 |
10 | 10223606452656 |
11 | 329189734a523 |
12 | 11914a1147440 |
13 | 59210b08147c |
14 | 274b7a484b72 |
15 | 12ae15a6baa6 |
hex | 94c5e6e51b0 |
10223606452656 has 20 divisors (see below), whose sum is σ = 26410983336152. Its totient is φ = 3407868817536.
The previous prime is 10223606452651. The next prime is 10223606452691. The reversal of 10223606452656 is 65625460632201.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 212991801097 = 10223606452656 / (1 + 0 + 2 + 2 + 3 + 6 + 0 + 6 + 4 + 5 + 2 + 6 + 5 + 6).
It is not an unprimeable number, because it can be changed into a prime (10223606452651) 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, 106495900501 + ... + 106495900596.
Almost surely, 210223606452656 is an apocalyptic number.
10223606452656 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
10223606452656 is an abundant number, since it is smaller than the sum of its proper divisors (16187376883496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10223606452656 is a wasteful number, since it uses less digits than its factorization.
10223606452656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212991801108 (or 212991801102 counting only the distinct ones).
The product of its (nonzero) digits is 3110400, while the sum is 48.
The spelling of 10223606452656 in words is "ten trillion, two hundred twenty-three billion, six hundred six million, four hundred fifty-two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •