Base | Representation |
---|---|
bin | 11010000000100010001000… |
… | …101001010101010101111010 |
3 | 120000000011220100211212122202 |
4 | 122000202020221111111322 |
5 | 104443044221030020040 |
6 | 1043140050034150202 |
7 | 33044051165640206 |
oct | 3200421051252572 |
9 | 500004810755582 |
10 | 114385861563770 |
11 | 334a0853901815 |
12 | 109b48b5722362 |
13 | 4ba9704518a14 |
14 | 203643b811b06 |
15 | d3568ac3a015 |
hex | 680888a5557a |
114385861563770 has 32 divisors (see below), whose sum is σ = 210649807645200. Its totient is φ = 44704785116160.
The previous prime is 114385861563763. The next prime is 114385861563817. The reversal of 114385861563770 is 77365168583411.
It can be written as a sum of positive squares in 8 ways, for example, as 86472275108209 + 27913586455561 = 9299047^2 + 5283331^2 .
It is a super-2 number, since 2×1143858615637702 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114385861563697 and 114385861563706.
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 15 ways as a sum of consecutive naturals, for example, 447636545 + ... + 447892004.
Almost surely, 2114385861563770 is an apocalyptic number.
114385861563770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114385861563770 is a deficient number, since it is larger than the sum of its proper divisors (96263946081430).
114385861563770 is a wasteful number, since it uses less digits than its factorization.
114385861563770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 895528850.
The product of its (nonzero) digits is 101606400, while the sum is 65.
The spelling of 114385861563770 in words is "one hundred fourteen trillion, three hundred eighty-five billion, eight hundred sixty-one million, five hundred sixty-three thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •