Base | Representation |
---|---|
bin | 10010111000000111… |
… | …01110010001110101 |
3 | 222011021200121002110 |
4 | 21130003232101311 |
5 | 131223402230303 |
6 | 4353343401233 |
7 | 506066046552 |
oct | 113403562165 |
9 | 28137617073 |
10 | 10134414453 |
11 | 4330681639 |
12 | 1b69bb3219 |
13 | c567c0357 |
14 | 6c1d51a29 |
15 | 3e4aae703 |
hex | 25c0ee475 |
10134414453 has 16 divisors (see below), whose sum is σ = 13677520896. Its totient is φ = 6674250240.
The previous prime is 10134414431. The next prime is 10134414463. The reversal of 10134414453 is 35441443101.
10134414453 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10134414453 - 25 = 10134414421 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10134414453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10134414463) 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, 31693 + ... + 145853.
It is an arithmetic number, because the mean of its divisors is an integer number (854845056).
Almost surely, 210134414453 is an apocalyptic number.
It is an amenable number.
10134414453 is a deficient number, since it is larger than the sum of its proper divisors (3543106443).
10134414453 is a wasteful number, since it uses less digits than its factorization.
10134414453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114524.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 10134414453 its reverse (35441443101), we get a palindrome (45575857554).
The spelling of 10134414453 in words is "ten billion, one hundred thirty-four million, four hundred fourteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •