Base | Representation |
---|---|
bin | 110101010100011010… |
… | …0110111101110000100 |
3 | 101221112210221000120020 |
4 | 1222220310313232010 |
5 | 3333444401103300 |
6 | 124333514135140 |
7 | 11162312246232 |
oct | 1525064675604 |
9 | 357483830506 |
10 | 114501581700 |
11 | 44618181070 |
12 | 1a2364214b0 |
13 | aa4a00860c |
14 | 5782dc1952 |
15 | 2ea23e98a0 |
hex | 1aa8d37b84 |
114501581700 has 72 divisors (see below), whose sum is σ = 361408639200. Its totient is φ = 27757958400.
The previous prime is 114501581693. The next prime is 114501581729. The reversal of 114501581700 is 7185105411.
114501581700 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1145015817002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17345425 + ... + 17352024.
Almost surely, 2114501581700 is an apocalyptic number.
114501581700 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114501581700 is an abundant number, since it is smaller than the sum of its proper divisors (246907057500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114501581700 is a wasteful number, since it uses less digits than its factorization.
114501581700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34697477 (or 34697470 counting only the distinct ones).
The product of its (nonzero) digits is 5600, while the sum is 33.
The spelling of 114501581700 in words is "one hundred fourteen billion, five hundred one million, five hundred eighty-one thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •