Base | Representation |
---|---|
bin | 10000011100100110011… |
… | …011000101101010001100 |
3 | 11000001022001021100220220 |
4 | 100130212123011222030 |
5 | 122004143041042444 |
6 | 2223114423111340 |
7 | 144440634164520 |
oct | 20344633055214 |
9 | 4001261240826 |
10 | 1130221034124 |
11 | 3a6362344256 |
12 | 1630648a2550 |
13 | 8276bbb06a0 |
14 | 3c9bb00bd80 |
15 | 1e5edbdb619 |
hex | 107266c5a8c |
1130221034124 has 48 divisors (see below), whose sum is σ = 3245762972928. Its totient is φ = 298080272448.
The previous prime is 1130221034123. The next prime is 1130221034177. The reversal of 1130221034124 is 4214301220311.
It is a junction number, because it is equal to n+sod(n) for n = 1130221034094 and 1130221034103.
It is not an unprimeable number, because it can be changed into a prime (1130221034123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 517499382 + ... + 517501565.
It is an arithmetic number, because the mean of its divisors is an integer number (67620061936).
Almost surely, 21130221034124 is an apocalyptic number.
1130221034124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1130221034124 is an abundant number, since it is smaller than the sum of its proper divisors (2115541938804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1130221034124 is a wasteful number, since it uses less digits than its factorization.
1130221034124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1035000974 (or 1035000972 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 1130221034124 its reverse (4214301220311), we get a palindrome (5344522254435).
The spelling of 1130221034124 in words is "one trillion, one hundred thirty billion, two hundred twenty-one million, thirty-four thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •