Base | Representation |
---|---|
bin | 110000111101101111… |
… | …1101100011101001110 |
3 | 101001102011101102011111 |
4 | 1201323133230131032 |
5 | 3210322141334410 |
6 | 120150013242234 |
7 | 10411512532441 |
oct | 1417337543516 |
9 | 331364342144 |
10 | 105151121230 |
11 | 4065a080791 |
12 | 18466a9337a |
13 | 9bb9a7067c |
14 | 513721d658 |
15 | 2b06592b8a |
hex | 187b7ec74e |
105151121230 has 8 divisors (see below), whose sum is σ = 189272018232. Its totient is φ = 42060448488.
The previous prime is 105151121209. The next prime is 105151121233. The reversal of 105151121230 is 32121151501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1051511212302 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105151121233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5257556052 + ... + 5257556071.
It is an arithmetic number, because the mean of its divisors is an integer number (23659002279).
Almost surely, 2105151121230 is an apocalyptic number.
105151121230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105151121230 is a deficient number, since it is larger than the sum of its proper divisors (84120897002).
105151121230 is a wasteful number, since it uses less digits than its factorization.
105151121230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10515112130.
The product of its (nonzero) digits is 300, while the sum is 22.
Adding to 105151121230 its reverse (32121151501), we get a palindrome (137272272731).
The spelling of 105151121230 in words is "one hundred five billion, one hundred fifty-one million, one hundred twenty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •