Base | Representation |
---|---|
bin | 110101011011000000… |
… | …1111010001110101100 |
3 | 101222010020202111120021 |
4 | 1222312001322032230 |
5 | 3334423103304120 |
6 | 124411510131524 |
7 | 11200642201654 |
oct | 1526601721654 |
9 | 358106674507 |
10 | 114723103660 |
11 | 44721223870 |
12 | 1a298650ba4 |
13 | aa83b899b9 |
14 | 57a45a7364 |
15 | 2eb6aa5aaa |
hex | 1ab607a3ac |
114723103660 has 48 divisors (see below), whose sum is σ = 264154413600. Its totient is φ = 41505712640.
The previous prime is 114723103601. The next prime is 114723103687. The reversal of 114723103660 is 66301327411.
114723103660 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×1147231036602 (a number of 23 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 1280185 + ... + 1366864.
It is an arithmetic number, because the mean of its divisors is an integer number (5503216950).
Almost surely, 2114723103660 is an apocalyptic number.
114723103660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114723103660 is an abundant number, since it is smaller than the sum of its proper divisors (149431309940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114723103660 is a wasteful number, since it uses less digits than its factorization.
114723103660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2647266 (or 2647264 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 34.
The spelling of 114723103660 in words is "one hundred fourteen billion, seven hundred twenty-three million, one hundred three thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •