Base | Representation |
---|---|
bin | 10011011111011101… |
… | …01100000000110001 |
3 | 1000000021200212011020 |
4 | 21233232230000301 |
5 | 132412344210330 |
6 | 4450213210053 |
7 | 520214211306 |
oct | 115756540061 |
9 | 30007625136 |
10 | 10464444465 |
11 | 448a9a7012 |
12 | 2040630929 |
13 | ca9ca3997 |
14 | 713b010ad |
15 | 413a51210 |
hex | 26fbac031 |
10464444465 has 32 divisors (see below), whose sum is σ = 17636849280. Its totient is φ = 5283542016.
The previous prime is 10464444449. The next prime is 10464444467. The reversal of 10464444465 is 56444446401.
10464444465 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10464444465 - 24 = 10464444449 is a prime.
It is a super-2 number, since 2×104644444652 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10464444467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 413209 + ... + 437801.
It is an arithmetic number, because the mean of its divisors is an integer number (551151540).
Almost surely, 210464444465 is an apocalyptic number.
10464444465 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10464444465 is a deficient number, since it is larger than the sum of its proper divisors (7172404815).
10464444465 is a wasteful number, since it uses less digits than its factorization.
10464444465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26113.
The product of its (nonzero) digits is 737280, while the sum is 42.
The spelling of 10464444465 in words is "ten billion, four hundred sixty-four million, four hundred forty-four thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •