Base | Representation |
---|---|
bin | 10011010011100010… |
… | …01111101010001001 |
3 | 222202022112200112210 |
4 | 21221301033222021 |
5 | 132211244421330 |
6 | 4432242055333 |
7 | 514561245444 |
oct | 115161175211 |
9 | 28668480483 |
10 | 10364451465 |
11 | 443950a875 |
12 | 201304a549 |
13 | c92363424 |
14 | 70471265b |
15 | 409d9d8b0 |
hex | 269c4fa89 |
10364451465 has 16 divisors (see below), whose sum is σ = 16968777408. Its totient is φ = 5399155776.
The previous prime is 10364451457. The next prime is 10364451467. The reversal of 10364451465 is 56415446301.
10364451465 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 10364451465 - 23 = 10364451457 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10364451467) 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 15 ways as a sum of consecutive naturals, for example, 8033814 + ... + 8035103.
It is an arithmetic number, because the mean of its divisors is an integer number (1060548588).
Almost surely, 210364451465 is an apocalyptic number.
10364451465 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10364451465 is a deficient number, since it is larger than the sum of its proper divisors (6604325943).
10364451465 is a wasteful number, since it uses less digits than its factorization.
10364451465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16068968.
The product of its (nonzero) digits is 172800, while the sum is 39.
Adding to 10364451465 its reverse (56415446301), we get a palindrome (66779897766).
The spelling of 10364451465 in words is "ten billion, three hundred sixty-four million, four hundred fifty-one thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •