Base | Representation |
---|---|
bin | 110101000110001111… |
… | …0110111101000000100 |
3 | 101220022200010121120211 |
4 | 1222030132313220010 |
5 | 3332011132131400 |
6 | 124214410005204 |
7 | 11144446310452 |
oct | 1521436675004 |
9 | 356280117524 |
10 | 114026052100 |
11 | 443a38086a4 |
12 | 1a123116804 |
13 | a9a264065c |
14 | 5739b999d2 |
15 | 2e757b6dba |
hex | 1a8c7b7a04 |
114026052100 has 18 divisors (see below), whose sum is σ = 247436533274. Its totient is φ = 45610420800.
The previous prime is 114026052071. The next prime is 114026052103. The reversal of 114026052100 is 1250620411.
114026052100 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 19270437124 + 94755614976 = 138818^2 + 307824^2 .
It is not an unprimeable number, because it can be changed into a prime (114026052103) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 570130161 + ... + 570130360.
Almost surely, 2114026052100 is an apocalyptic number.
114026052100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114026052100 is an abundant number, since it is smaller than the sum of its proper divisors (133410481174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114026052100 is a wasteful number, since it uses less digits than its factorization.
114026052100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1140260535 (or 1140260528 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 114026052100 its reverse (1250620411), we get a palindrome (115276672511).
The spelling of 114026052100 in words is "one hundred fourteen billion, twenty-six million, fifty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •