Base | Representation |
---|---|
bin | 110101010010000010… |
… | …1010111110100100100 |
3 | 101221100021012221100220 |
4 | 1222210011113310210 |
5 | 3333314014141122 |
6 | 124321553004340 |
7 | 11160325064106 |
oct | 1524405276444 |
9 | 357307187326 |
10 | 114422021412 |
11 | 44587280266 |
12 | 1a2138536b0 |
13 | aa366a041a |
14 | 57765d1576 |
15 | 2e9a43125c |
hex | 1aa4157d24 |
114422021412 has 24 divisors (see below), whose sum is σ = 267009607200. Its totient is φ = 38137118016.
The previous prime is 114422021383. The next prime is 114422021437. The reversal of 114422021412 is 214120224411.
It is a happy number.
114422021412 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 308737 + ... + 569352.
It is an arithmetic number, because the mean of its divisors is an integer number (11125400300).
Almost surely, 2114422021412 is an apocalyptic number.
114422021412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
114422021412 is an abundant number, since it is smaller than the sum of its proper divisors (152587585788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114422021412 is a wasteful number, since it uses less digits than its factorization.
114422021412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888955 (or 888953 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 24.
Adding to 114422021412 its reverse (214120224411), we get a palindrome (328542245823).
The spelling of 114422021412 in words is "one hundred fourteen billion, four hundred twenty-two million, twenty-one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •