Base | Representation |
---|---|
bin | 11010010000010000010110… |
… | …000101110010010100101000 |
3 | 120010211110121222120021110220 |
4 | 122100100112011302110220 |
5 | 110113244410434320011 |
6 | 1045324250042410040 |
7 | 33215106563014266 |
oct | 3220202605622450 |
9 | 503743558507426 |
10 | 115466271401256 |
11 | 33877a75008756 |
12 | 10b4a178800920 |
13 | 4c575657c3549 |
14 | 20728511d9436 |
15 | d53821928506 |
hex | 690416172528 |
115466271401256 has 16 divisors (see below), whose sum is σ = 288665678503200. Its totient is φ = 38488757133744.
The previous prime is 115466271401179. The next prime is 115466271401309. The reversal of 115466271401256 is 652104172664511.
It is a junction number, because it is equal to n+sod(n) for n = 115466271401199 and 115466271401208.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2405547320836 + ... + 2405547320883.
It is an arithmetic number, because the mean of its divisors is an integer number (18041604906450).
Almost surely, 2115466271401256 is an apocalyptic number.
It is an amenable number.
115466271401256 is an abundant number, since it is smaller than the sum of its proper divisors (173199407101944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115466271401256 is a wasteful number, since it uses less digits than its factorization.
115466271401256 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4811094641728 (or 4811094641724 counting only the distinct ones).
The product of its (nonzero) digits is 2419200, while the sum is 51.
The spelling of 115466271401256 in words is "one hundred fifteen trillion, four hundred sixty-six billion, two hundred seventy-one million, four hundred one thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •