Base | Representation |
---|---|
bin | 110000100100101011… |
… | …1100101000110000010 |
3 | 100222020112220210100210 |
4 | 1201021113211012002 |
5 | 3202111343224442 |
6 | 115530332054550 |
7 | 10351621334166 |
oct | 1411127450602 |
9 | 328215823323 |
10 | 104310133122 |
11 | 40268394998 |
12 | 18271304456 |
13 | 9ab4769280 |
14 | 5097664ca6 |
15 | 2aa782119c |
hex | 18495e5182 |
104310133122 has 64 divisors (see below), whose sum is σ = 228588917760. Its totient is φ = 31535832384.
The previous prime is 104310133061. The next prime is 104310133127. The reversal of 104310133122 is 221331013401.
It is a super-2 number, since 2×1043101331222 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (104310133127) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12177213 + ... + 12185775.
It is an arithmetic number, because the mean of its divisors is an integer number (3571701840).
Almost surely, 2104310133122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 104310133122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114294458880).
104310133122 is an abundant number, since it is smaller than the sum of its proper divisors (124278784638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104310133122 is a wasteful number, since it uses less digits than its factorization.
104310133122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11287.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 104310133122 its reverse (221331013401), we get a palindrome (325641146523).
The spelling of 104310133122 in words is "one hundred four billion, three hundred ten million, one hundred thirty-three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •