Base | Representation |
---|---|
bin | 11010000010100010111010… |
… | …110100011111001100111010 |
3 | 120000111101211101110012122110 |
4 | 122002202322310133030322 |
5 | 110002330420412131020 |
6 | 1043323355322233150 |
7 | 33060045002551440 |
oct | 3202427264371472 |
9 | 500441741405573 |
10 | 114524142302010 |
11 | 33544463767071 |
12 | 10a176676557b6 |
13 | 4bb9770b4905c |
14 | 203cdd8982b90 |
15 | d39080a508e0 |
hex | 6828bad1f33a |
114524142302010 has 64 divisors (see below), whose sum is σ = 327780899223552. Its totient is φ = 25038818688576.
The previous prime is 114524142301981. The next prime is 114524142302029. The reversal of 114524142302010 is 10203241425411.
It is a super-2 number, since 2×1145241423020102 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11855496444 + ... + 11855506103.
It is an arithmetic number, because the mean of its divisors is an integer number (5121576550368).
Almost surely, 2114524142302010 is an apocalyptic number.
114524142302010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114524142302010 is an abundant number, since it is smaller than the sum of its proper divisors (213256756921542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114524142302010 is a wasteful number, since it uses less digits than its factorization.
114524142302010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23711002587.
The product of its (nonzero) digits is 7680, while the sum is 30.
Adding to 114524142302010 its reverse (10203241425411), we get a palindrome (124727383727421).
The spelling of 114524142302010 in words is "one hundred fourteen trillion, five hundred twenty-four billion, one hundred forty-two million, three hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •