Base | Representation |
---|---|
bin | 10010111010001110… |
… | …10100011011010010 |
3 | 222012112000212020002 |
4 | 21131013110123102 |
5 | 131242421244404 |
6 | 4355215250002 |
7 | 506402501225 |
oct | 113507243322 |
9 | 28175025202 |
10 | 10152134354 |
11 | 433a68488a |
12 | 1b73b19902 |
13 | c5a3859bb |
14 | 6c44455bc |
15 | 3e640ec1e |
hex | 25d1d46d2 |
10152134354 has 4 divisors (see below), whose sum is σ = 15228201534. Its totient is φ = 5076067176.
The previous prime is 10152134351. The next prime is 10152134357. The reversal of 10152134354 is 45343125101.
10152134354 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (10152134351) and next prime (10152134357).
It can be written as a sum of positive squares in only one way, i.e., 9598708729 + 553425625 = 97973^2 + 23525^2 .
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10152134351) 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 as a sum of consecutive naturals, namely, 2538033587 + ... + 2538033590.
Almost surely, 210152134354 is an apocalyptic number.
10152134354 is a deficient number, since it is larger than the sum of its proper divisors (5076067180).
10152134354 is an equidigital number, since it uses as much as digits as its factorization.
10152134354 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5076067179.
The product of its (nonzero) digits is 7200, while the sum is 29.
Adding to 10152134354 its reverse (45343125101), we get a palindrome (55495259455).
The spelling of 10152134354 in words is "ten billion, one hundred fifty-two million, one hundred thirty-four thousand, three hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •