Base | Representation |
---|---|
bin | 11010001001011110010100… |
… | …101100100001100111110111 |
3 | 120002011220201201212221202211 |
4 | 122021132110230201213313 |
5 | 110033130444434103143 |
6 | 1044330214403114251 |
7 | 33136331152624204 |
oct | 3211362454414767 |
9 | 502156651787684 |
10 | 115000244050423 |
11 | 33708369797416 |
12 | 10a93999072987 |
13 | 4c22626aa4054 |
14 | 2058081c94cab |
15 | d4664859049d |
hex | 689794b219f7 |
115000244050423 has 6 divisors (see below), whose sum is σ = 115119292730856. Its totient is φ = 114881318355132.
The previous prime is 115000244050399. The next prime is 115000244050441. The reversal of 115000244050423 is 324050442000511.
It is a de Polignac number, because none of the positive numbers 2k-115000244050423 is a prime.
It is a super-2 number, since 2×1150002440504232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115000244150423) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 60556515 + ... + 62426692.
It is an arithmetic number, because the mean of its divisors is an integer number (19186548788476).
Almost surely, 2115000244050423 is an apocalyptic number.
115000244050423 is a deficient number, since it is larger than the sum of its proper divisors (119048680433).
115000244050423 is an frugal number, since it uses more digits than its factorization.
115000244050423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122985141 (or 122984174 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 115000244050423 its reverse (324050442000511), we get a palindrome (439050686050934).
The spelling of 115000244050423 in words is "one hundred fifteen trillion, two hundred forty-four million, fifty thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •