Base | Representation |
---|---|
bin | 110101010100100011… |
… | …0000100100000100001 |
3 | 101221120010102002111220 |
4 | 1222221012010200201 |
5 | 3334002024344104 |
6 | 124334154525253 |
7 | 11162365465425 |
oct | 1525106044041 |
9 | 357503362456 |
10 | 114506090529 |
11 | 4461a780676 |
12 | 1a237a36829 |
13 | aa4ac2696c |
14 | 5783836b85 |
15 | 2ea29da7d9 |
hex | 1aa9184821 |
114506090529 has 16 divisors (see below), whose sum is σ = 152813203200. Its totient is φ = 76268226816.
The previous prime is 114506090527. The next prime is 114506090533. The reversal of 114506090529 is 925090605411.
It is not a de Polignac number, because 114506090529 - 21 = 114506090527 is a prime.
It is a super-2 number, since 2×1145060905292 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (114506090521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29216232 + ... + 29220150.
It is an arithmetic number, because the mean of its divisors is an integer number (9550825200).
Almost surely, 2114506090529 is an apocalyptic number.
It is an amenable number.
114506090529 is a deficient number, since it is larger than the sum of its proper divisors (38307112671).
114506090529 is a wasteful number, since it uses less digits than its factorization.
114506090529 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10264.
The product of its (nonzero) digits is 97200, while the sum is 42.
The spelling of 114506090529 in words is "one hundred fourteen billion, five hundred six million, ninety thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •