Base | Representation |
---|---|
bin | 11001111010111011010001… |
… | …111100000100011100111011 |
3 | 112221122100022221011102222211 |
4 | 121322323101330010130323 |
5 | 104420241103300433301 |
6 | 1042243043232555551 |
7 | 33004160521003012 |
oct | 3172732174043473 |
9 | 487570287142884 |
10 | 114000544155451 |
11 | 333623a5207908 |
12 | 1095209b6b2bb7 |
13 | 4b7c288a42065 |
14 | 202192764ba79 |
15 | d2a638359051 |
hex | 67aed1f0473b |
114000544155451 has 8 divisors (see below), whose sum is σ = 114305273043264. Its totient is φ = 113696028742920.
The previous prime is 114000544155427. The next prime is 114000544155461. The reversal of 114000544155451 is 154551445000411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114000544155451 - 211 = 114000544153403 is a prime.
It is a super-2 number, since 2×1140005441554512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114000544155461) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52299321 + ... + 54435466.
It is an arithmetic number, because the mean of its divisors is an integer number (14288159130408).
Almost surely, 2114000544155451 is an apocalyptic number.
114000544155451 is a deficient number, since it is larger than the sum of its proper divisors (304728887813).
114000544155451 is a wasteful number, since it uses less digits than its factorization.
114000544155451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106737641.
The product of its (nonzero) digits is 160000, while the sum is 40.
Adding to 114000544155451 its reverse (154551445000411), we get a palindrome (268551989155862).
The spelling of 114000544155451 in words is "one hundred fourteen trillion, five hundred forty-four million, one hundred fifty-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •