Base | Representation |
---|---|
bin | 10010110100100001… |
… | …11000101010110111 |
3 | 222002012001011011120 |
4 | 21122100320222313 |
5 | 131143200413310 |
6 | 4350350235023 |
7 | 505252136031 |
oct | 113220705267 |
9 | 28065034146 |
10 | 10104310455 |
11 | 431568aaa8 |
12 | 1b5bab5a73 |
13 | c504acc35 |
14 | 6bbd56c51 |
15 | 3e2114b70 |
hex | 25a438ab7 |
10104310455 has 16 divisors (see below), whose sum is σ = 16168335360. Its totient is φ = 5388486048.
The previous prime is 10104310379. The next prime is 10104310457. The reversal of 10104310455 is 55401340101.
It is a happy number.
10104310455 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 10104310455 - 27 = 10104310327 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10104310457) 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, 202266 + ... + 247224.
It is an arithmetic number, because the mean of its divisors is an integer number (1010520960).
Almost surely, 210104310455 is an apocalyptic number.
10104310455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10104310455 is a deficient number, since it is larger than the sum of its proper divisors (6064024905).
10104310455 is a wasteful number, since it uses less digits than its factorization.
10104310455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59950.
The product of its (nonzero) digits is 1200, while the sum is 24.
Adding to 10104310455 its reverse (55401340101), we get a palindrome (65505650556).
The spelling of 10104310455 in words is "ten billion, one hundred four million, three hundred ten thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •