Base | Representation |
---|---|
bin | 110101001100101111… |
… | …0011001011000000001 |
3 | 101220212212022010210111 |
4 | 1222121132121120001 |
5 | 3332432433011001 |
6 | 124252154031321 |
7 | 11153034151411 |
oct | 1523136313001 |
9 | 356785263714 |
10 | 114244032001 |
11 | 444a5861180 |
12 | 1a184118541 |
13 | aa08851748 |
14 | 575aadc641 |
15 | 2e899c3851 |
hex | 1a99799601 |
114244032001 has 8 divisors (see below), whose sum is σ = 126030189600. Its totient is φ = 102691263840.
The previous prime is 114244031939. The next prime is 114244032031. The reversal of 114244032001 is 100230442411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114244032001 - 229 = 113707161089 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114244032031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58346331 + ... + 58348288.
It is an arithmetic number, because the mean of its divisors is an integer number (15753773700).
Almost surely, 2114244032001 is an apocalyptic number.
114244032001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
114244032001 is a deficient number, since it is larger than the sum of its proper divisors (11786157599).
114244032001 is a wasteful number, since it uses less digits than its factorization.
114244032001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116694719.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 114244032001 its reverse (100230442411), we get a palindrome (214474474412).
The spelling of 114244032001 in words is "one hundred fourteen billion, two hundred forty-four million, thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •