Base | Representation |
---|---|
bin | 11011101111010111011111… |
… | …110100111010010000000010 |
3 | 120222222022021010210120221011 |
4 | 123233113133310322100002 |
5 | 111442341203103412010 |
6 | 1111251030005151134 |
7 | 34461242520634624 |
oct | 3357273764722002 |
9 | 528868233716834 |
10 | 122002301232130 |
11 | 359679814a7830 |
12 | 11824a439bb4aa |
13 | 530c9c9677c57 |
14 | 221ad2b3ccc14 |
15 | e1885e699a8a |
hex | 6ef5dfd3a402 |
122002301232130 has 16 divisors (see below), whose sum is σ = 239568155146944. Its totient is φ = 44364473175280.
The previous prime is 122002301232113. The next prime is 122002301232143. The reversal of 122002301232130 is 31232103200221.
It is a super-2 number, since 2×1220023012321302 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
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, 554555914582 + ... + 554555914801.
It is an arithmetic number, because the mean of its divisors is an integer number (14973009696684).
Almost surely, 2122002301232130 is an apocalyptic number.
122002301232130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122002301232130 is a deficient number, since it is larger than the sum of its proper divisors (117565853914814).
122002301232130 is a wasteful number, since it uses less digits than its factorization.
122002301232130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1109111829401.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 122002301232130 its reverse (31232103200221), we get a palindrome (153234404432351).
The spelling of 122002301232130 in words is "one hundred twenty-two trillion, two billion, three hundred one million, two hundred thirty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •