Base | Representation |
---|---|
bin | 111100100101011000… |
… | …0000001010101000110 |
3 | 110102211002222100100100 |
4 | 1321022300001111012 |
5 | 4112422344334342 |
6 | 135434001224530 |
7 | 12254035166214 |
oct | 1711260012506 |
9 | 412732870310 |
10 | 130103121222 |
11 | 501a3902688 |
12 | 2126b332146 |
13 | c36536bbc9 |
14 | 642306dcb4 |
15 | 35b6e32e4c |
hex | 1e4ac01546 |
130103121222 has 24 divisors (see below), whose sum is σ = 282040190640. Its totient is φ = 43344615600.
The previous prime is 130103121221. The next prime is 130103121241. The reversal of 130103121222 is 222121301031.
130103121222 is a `hidden beast` number, since 130 + 1 + 0 + 312 + 1 + 222 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 130103121195 and 130103121204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130103121221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1889529 + ... + 1957172.
It is an arithmetic number, because the mean of its divisors is an integer number (11751674610).
Almost surely, 2130103121222 is an apocalyptic number.
130103121222 is an abundant number, since it is smaller than the sum of its proper divisors (151937069418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130103121222 is a wasteful number, since it uses less digits than its factorization.
130103121222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3848588 (or 3848585 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 130103121222 its reverse (222121301031), we get a palindrome (352224422253).
The spelling of 130103121222 in words is "one hundred thirty billion, one hundred three million, one hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •