Base | Representation |
---|---|
bin | 11011110000111110101101… |
… | …110000010000001110100000 |
3 | 121000100220100000020121001111 |
4 | 123300332231300100032200 |
5 | 112001200142324102240 |
6 | 1111413555252513104 |
7 | 34502245130316535 |
oct | 3360765560201640 |
9 | 530326300217044 |
10 | 122113130300320 |
11 | 359aa984632065 |
12 | 1184241431b794 |
13 | 531a2ac864843 |
14 | 2222442746d8c |
15 | e1b69945c1ea |
hex | 6f0fadc103a0 |
122113130300320 has 48 divisors (see below), whose sum is σ = 288535209661440. Its totient is φ = 48837981969664.
The previous prime is 122113130300279. The next prime is 122113130300401. The reversal of 122113130300320 is 23003031311221.
It is a junction number, because it is equal to n+sod(n) for n = 122113130300291 and 122113130300300.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55719652 + ... + 57869731.
It is an arithmetic number, because the mean of its divisors is an integer number (6011150201280).
Almost surely, 2122113130300320 is an apocalyptic number.
122113130300320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122113130300320 is an abundant number, since it is smaller than the sum of its proper divisors (166422079361120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122113130300320 is a wasteful number, since it uses less digits than its factorization.
122113130300320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113596117 (or 113596109 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 122113130300320 its reverse (23003031311221), we get a palindrome (145116161611541).
The spelling of 122113130300320 in words is "one hundred twenty-two trillion, one hundred thirteen billion, one hundred thirty million, three hundred thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •