Base | Representation |
---|---|
bin | 110101011101011111… |
… | …1111101000010010110 |
3 | 101222100001122022012220 |
4 | 1222322333331002112 |
5 | 3340110424230300 |
6 | 124424045123210 |
7 | 11203003644534 |
oct | 1527277750226 |
9 | 358301568186 |
10 | 114806476950 |
11 | 44764299410 |
12 | 1a300559506 |
13 | aa9822b5c9 |
14 | 57b16ab154 |
15 | 2ebe073da0 |
hex | 1abaffd096 |
114806476950 has 48 divisors (see below), whose sum is σ = 310603709376. Its totient is φ = 27831872800.
The previous prime is 114806476937. The next prime is 114806476987. The reversal of 114806476950 is 59674608411.
It is a junction number, because it is equal to n+sod(n) for n = 114806476893 and 114806476902.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34788192 + ... + 34791491.
It is an arithmetic number, because the mean of its divisors is an integer number (6470910612).
Almost surely, 2114806476950 is an apocalyptic number.
114806476950 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114806476950 is an abundant number, since it is smaller than the sum of its proper divisors (195797232426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114806476950 is a wasteful number, since it uses less digits than its factorization.
114806476950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69579709 (or 69579704 counting only the distinct ones).
The product of its (nonzero) digits is 1451520, while the sum is 51.
The spelling of 114806476950 in words is "one hundred fourteen billion, eight hundred six million, four hundred seventy-six thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •