Base | Representation |
---|---|
bin | 11010001001101010011001… |
… | …001011000000100111100110 |
3 | 120002020011011221102021100001 |
4 | 122021222121023000213212 |
5 | 110033334020214134304 |
6 | 1044340200405011514 |
7 | 33140300262052531 |
oct | 3211523113004746 |
9 | 502204157367301 |
10 | 115013204052454 |
11 | 3371290a3327a4 |
12 | 10a963b53b3b9a |
13 | 4c23910ab00c6 |
14 | 20589511aba18 |
15 | d46b56240da4 |
hex | 689a992c09e6 |
115013204052454 has 4 divisors (see below), whose sum is σ = 172519806078684. Its totient is φ = 57506602026226.
The previous prime is 115013204052437. The next prime is 115013204052499. The reversal of 115013204052454 is 454250402310511.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×1150132040524543 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28753301013112 + ... + 28753301013115.
It is an arithmetic number, because the mean of its divisors is an integer number (43129951519671).
Almost surely, 2115013204052454 is an apocalyptic number.
115013204052454 is a deficient number, since it is larger than the sum of its proper divisors (57506602026230).
115013204052454 is an equidigital number, since it uses as much as digits as its factorization.
115013204052454 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57506602026229.
The product of its (nonzero) digits is 96000, while the sum is 37.
Adding to 115013204052454 its reverse (454250402310511), we get a palindrome (569263606362965).
The spelling of 115013204052454 in words is "one hundred fifteen trillion, thirteen billion, two hundred four million, fifty-two thousand, four hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •