Base | Representation |
---|---|
bin | 110101010100110010… |
… | …0010000100010111001 |
3 | 101221120200022010222002 |
4 | 1222221210100202321 |
5 | 3334011041113103 |
6 | 124335040310345 |
7 | 11162522655263 |
oct | 1525144204271 |
9 | 357520263862 |
10 | 114514004153 |
11 | 4462419625a |
12 | 1a23a6123b5 |
13 | aa4c767993 |
14 | 57848d6b33 |
15 | 2ea3550488 |
hex | 1aa99108b9 |
114514004153 has 4 divisors (see below), whose sum is σ = 114524890740. Its totient is φ = 114503117568.
The previous prime is 114514004149. The next prime is 114514004159. The reversal of 114514004153 is 351400415411.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 52735907449 + 61778096704 = 229643^2 + 248552^2 .
It is a cyclic number.
It is not a de Polignac number, because 114514004153 - 22 = 114514004149 is a prime.
It is a super-2 number, since 2×1145140041532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114514004159) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5427500 + ... + 5448557.
It is an arithmetic number, because the mean of its divisors is an integer number (28631222685).
Almost surely, 2114514004153 is an apocalyptic number.
It is an amenable number.
114514004153 is a deficient number, since it is larger than the sum of its proper divisors (10886587).
114514004153 is a wasteful number, since it uses less digits than its factorization.
114514004153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10886586.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 114514004153 its reverse (351400415411), we get a palindrome (465914419564).
The spelling of 114514004153 in words is "one hundred fourteen billion, five hundred fourteen million, four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •