Base | Representation |
---|---|
bin | 1010011000011101110101… |
… | …1100111010111000010100 |
3 | 1111102022020212210122222011 |
4 | 2212013131130322320110 |
5 | 2444012312010421122 |
6 | 40140103214314004 |
7 | 2255511221230120 |
oct | 246073534727024 |
9 | 44368225718864 |
10 | 11415443451412 |
11 | 37012982569a0 |
12 | 1344480ab8904 |
13 | 64a619424510 |
14 | 2b67207d4580 |
15 | 14be1dcb0377 |
hex | a61dd73ae14 |
11415443451412 has 48 divisors (see below), whose sum is σ = 26822300706432. Its totient is φ = 4105454186880.
The previous prime is 11415443451409. The next prime is 11415443451473. The reversal of 11415443451412 is 21415434451411.
It is a super-2 number, since 2×114154434514122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1425500923 + ... + 1425508930.
It is an arithmetic number, because the mean of its divisors is an integer number (558797931384).
Almost surely, 211415443451412 is an apocalyptic number.
It is an amenable number.
11415443451412 is an abundant number, since it is smaller than the sum of its proper divisors (15406857255020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11415443451412 is a wasteful number, since it uses less digits than its factorization.
11415443451412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2851009888 (or 2851009886 counting only the distinct ones).
The product of its digits is 153600, while the sum is 40.
Subtracting 11415443451412 from its reverse (21415434451411), we obtain a palindrome (9999990999999).
The spelling of 11415443451412 in words is "eleven trillion, four hundred fifteen billion, four hundred forty-three million, four hundred fifty-one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •