Base | Representation |
---|---|
bin | 11010001111101111100001… |
… | …100011011001111111100000 |
3 | 120010201002122222002112202220 |
4 | 122033233201203121333200 |
5 | 110112210222220010404 |
6 | 1045300141102111040 |
7 | 33212421352030533 |
oct | 3217574143317740 |
9 | 503632588075686 |
10 | 115431030235104 |
11 | 33864030317a51 |
12 | 10b4338257b480 |
13 | 4c5413a630ccc |
14 | 2070c6aa72a1a |
15 | d5295cb0b4d9 |
hex | 68fbe18d9fe0 |
115431030235104 has 48 divisors (see below), whose sum is σ = 310396855703760. Its totient is φ = 37538546416640.
The previous prime is 115431030235091. The next prime is 115431030235133. The reversal of 115431030235104 is 401532030134511.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×1154310302351042 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14663490759 + ... + 14663498630.
It is an arithmetic number, because the mean of its divisors is an integer number (6466601160495).
Almost surely, 2115431030235104 is an apocalyptic number.
It is an amenable number.
115431030235104 is an abundant number, since it is smaller than the sum of its proper divisors (194965825468656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115431030235104 is a wasteful number, since it uses less digits than its factorization.
115431030235104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29326989443 (or 29326989435 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 115431030235104 its reverse (401532030134511), we get a palindrome (516963060369615).
The spelling of 115431030235104 in words is "one hundred fifteen trillion, four hundred thirty-one billion, thirty million, two hundred thirty-five thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •