Base | Representation |
---|---|
bin | 110101001001111100… |
… | …0111001000110111000 |
3 | 101220122022221210110010 |
4 | 1222103320321012320 |
5 | 3332234440030144 |
6 | 124235005221520 |
7 | 11150515443336 |
oct | 1522370710670 |
9 | 356568853403 |
10 | 114150314424 |
11 | 44457970833 |
12 | 1a1588618a0 |
13 | a9c22ca663 |
14 | 574c4a4b56 |
15 | 2e816605b9 |
hex | 1a93e391b8 |
114150314424 has 32 divisors (see below), whose sum is σ = 285392257920. Its totient is φ = 38047908576.
The previous prime is 114150314407. The next prime is 114150314441. The reversal of 114150314424 is 424413051411.
It is an interprime number because it is at equal distance from previous prime (114150314407) and next prime (114150314441).
It is a junction number, because it is equal to n+sod(n) for n = 114150314391 and 114150314400.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 318019 + ... + 573965.
It is an arithmetic number, because the mean of its divisors is an integer number (8918508060).
Almost surely, 2114150314424 is an apocalyptic number.
It is an amenable number.
114150314424 is an abundant number, since it is smaller than the sum of its proper divisors (171241943496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114150314424 is a wasteful number, since it uses less digits than its factorization.
114150314424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274539 (or 274535 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 114150314424 its reverse (424413051411), we get a palindrome (538563365835).
The spelling of 114150314424 in words is "one hundred fourteen billion, one hundred fifty million, three hundred fourteen thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •