Base | Representation |
---|---|
bin | 110101011001110001… |
… | …0001000110101101010 |
3 | 101222000022221121121120 |
4 | 1222303202020311222 |
5 | 3334331343023313 |
6 | 124403412320110 |
7 | 11166623201340 |
oct | 1526342106552 |
9 | 358008847546 |
10 | 114681220458 |
11 | 446aa617352 |
12 | 1a286613036 |
13 | aa782b3c3c |
14 | 579cbc3990 |
15 | 2eb3080d23 |
hex | 1ab3888d6a |
114681220458 has 128 divisors (see below), whose sum is σ = 270888468480. Its totient is φ = 31686528000.
The previous prime is 114681220453. The next prime is 114681220463. The reversal of 114681220458 is 854022186411.
It is an interprime number because it is at equal distance from previous prime (114681220453) and next prime (114681220463).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (114681220453) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 141756358 + ... + 141757166.
It is an arithmetic number, because the mean of its divisors is an integer number (2116316160).
Almost surely, 2114681220458 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 114681220458, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135444234240).
114681220458 is an abundant number, since it is smaller than the sum of its proper divisors (156207248022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114681220458 is a wasteful number, since it uses less digits than its factorization.
114681220458 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1484.
The product of its (nonzero) digits is 122880, while the sum is 42.
The spelling of 114681220458 in words is "one hundred fourteen billion, six hundred eighty-one million, two hundred twenty thousand, four hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •