Base | Representation |
---|---|
bin | 10011001101101000001… |
… | …000110011111010011000 |
3 | 11200012221010022222221020 |
4 | 103031220020303322120 |
5 | 133112434314200440 |
6 | 2450312144042440 |
7 | 164250213452553 |
oct | 23155010637230 |
9 | 4605833288836 |
10 | 1320302100120 |
11 | 469a3412a533 |
12 | 193a72603420 |
13 | 97672256a33 |
14 | 47c8da2d69a |
15 | 245264673d0 |
hex | 13368233e98 |
1320302100120 has 64 divisors (see below), whose sum is σ = 3961189945440. Its totient is φ = 352055347200.
The previous prime is 1320302100113. The next prime is 1320302100133. The reversal of 1320302100120 is 210012030231.
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 1320302100120.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1319680 + ... + 2093360.
Almost surely, 21320302100120 is an apocalyptic number.
1320302100120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1320302100120 is an abundant number, since it is smaller than the sum of its proper divisors (2640887845320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1320302100120 is a wasteful number, since it uses less digits than its factorization.
1320302100120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 787916 (or 787912 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1320302100120 its reverse (210012030231), we get a palindrome (1530314130351).
The spelling of 1320302100120 in words is "one trillion, three hundred twenty billion, three hundred two million, one hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •