Base | Representation |
---|---|
bin | 11011010100000111110010… |
… | …001010110110000111110110 |
3 | 120202100022112110210102222011 |
4 | 123110013302022312013312 |
5 | 111221202221311344342 |
6 | 1103254543413154434 |
7 | 34206051316340035 |
oct | 3324076212660766 |
9 | 522308473712864 |
10 | 120130003231222 |
11 | 3530593704aa76 |
12 | 11581bbb02ba1a |
13 | 5205297b9316a |
14 | 2194474b3a71c |
15 | dd4ccc906717 |
hex | 6d41f22b61f6 |
120130003231222 has 8 divisors (see below), whose sum is σ = 180195354734256. Its totient is φ = 60064884986472.
The previous prime is 120130003231177. The next prime is 120130003231229. The reversal of 120130003231222 is 222132300031021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1201300032312222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 120130003231193 and 120130003231202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120130003231229) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57021313 + ... + 59090524.
It is an arithmetic number, because the mean of its divisors is an integer number (22524419341782).
Almost surely, 2120130003231222 is an apocalyptic number.
120130003231222 is a deficient number, since it is larger than the sum of its proper divisors (60065351503034).
120130003231222 is a wasteful number, since it uses less digits than its factorization.
120130003231222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116629142.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 120130003231222 its reverse (222132300031021), we get a palindrome (342262303262243).
The spelling of 120130003231222 in words is "one hundred twenty trillion, one hundred thirty billion, three million, two hundred thirty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •