Base | Representation |
---|---|
bin | 11010001101000000101111… |
… | …000101000100101101101010 |
3 | 120010001011020101000220221202 |
4 | 122031000233011010231222 |
5 | 110101121341200023300 |
6 | 1045034022025404202 |
7 | 33163025463215510 |
oct | 3215005705045552 |
9 | 503034211026852 |
10 | 115243352345450 |
11 | 337a148201371a |
12 | 10b12b25639662 |
13 | 4c3c52b1162b4 |
14 | 2065b4529a4b0 |
15 | d4cb26332ad5 |
hex | 68d02f144b6a |
115243352345450 has 48 divisors (see below), whose sum is σ = 245110463098944. Its totient is φ = 39490067376000.
The previous prime is 115243352345441. The next prime is 115243352345461. The reversal of 115243352345450 is 54543253342511.
It is a super-2 number, since 2×1152433523454502 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 115243352345395 and 115243352345404.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 90781844 + ... + 92042543.
It is an arithmetic number, because the mean of its divisors is an integer number (5106467981228).
Almost surely, 2115243352345450 is an apocalyptic number.
115243352345450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
115243352345450 is an abundant number, since it is smaller than the sum of its proper divisors (129867110753494).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115243352345450 is a wasteful number, since it uses less digits than its factorization.
115243352345450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182826207 (or 182826202 counting only the distinct ones).
The product of its (nonzero) digits is 4320000, while the sum is 47.
The spelling of 115243352345450 in words is "one hundred fifteen trillion, two hundred forty-three billion, three hundred fifty-two million, three hundred forty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •