Base | Representation |
---|---|
bin | 10000010101111000101… |
… | …000010100110011000000 |
3 | 10222100200112000011210120 |
4 | 100111320220110303000 |
5 | 121344411114113440 |
6 | 2215523120100240 |
7 | 144064146026361 |
oct | 20257050246300 |
9 | 3870615004716 |
10 | 1123010301120 |
11 | 3a32a2046884 |
12 | 161791a64680 |
13 | 81b90033076 |
14 | 3c4d54b7b68 |
15 | 1e32ab47dd0 |
hex | 10578a14cc0 |
1123010301120 has 112 divisors (see below), whose sum is σ = 3661924246368. Its totient is φ = 291375636480.
The previous prime is 1123010301097. The next prime is 1123010301181. The reversal of 1123010301120 is 211030103211.
It is a happy number.
It is a super-2 number, since 2×11230103011202 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1123010301120.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15772621 + ... + 15843660.
Almost surely, 21123010301120 is an apocalyptic number.
1123010301120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1123010301120 is an abundant number, since it is smaller than the sum of its proper divisors (2538913945248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1123010301120 is a wasteful number, since it uses less digits than its factorization.
1123010301120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31616338 (or 31616328 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1123010301120 its reverse (211030103211), we get a palindrome (1334040404331).
The spelling of 1123010301120 in words is "one trillion, one hundred twenty-three billion, ten million, three hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •