Base | Representation |
---|---|
bin | 11010001111100101010001… |
… | …011111010011010010111000 |
3 | 120010200001020212121120202210 |
4 | 122033211101133103102320 |
5 | 110112020201431233100 |
6 | 1045251120545255120 |
7 | 33211551526463502 |
oct | 3217452137232270 |
9 | 503601225546683 |
10 | 115420023305400 |
11 | 3385a3a2186830 |
12 | 10b412103344a0 |
13 | 4c530a514b458 |
14 | 2070504cbad72 |
15 | d5251664dc50 |
hex | 68f9517d34b8 |
115420023305400 has 192 divisors, whose sum is σ = 391376001582720. Its totient is φ = 27905596070400.
The previous prime is 115420023305333. The next prime is 115420023305423. The reversal of 115420023305400 is 4503320024511.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20980402 + ... + 25904001.
It is an arithmetic number, because the mean of its divisors is an integer number (2038416674910).
Almost surely, 2115420023305400 is an apocalyptic number.
115420023305400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
115420023305400 is an abundant number, since it is smaller than the sum of its proper divisors (275955978277320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115420023305400 is a wasteful number, since it uses less digits than its factorization.
115420023305400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46884806 (or 46884797 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 115420023305400 its reverse (4503320024511), we get a palindrome (119923343329911).
The spelling of 115420023305400 in words is "one hundred fifteen trillion, four hundred twenty billion, twenty-three million, three hundred five thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •