Base | Representation |
---|---|
bin | 110000001010010110… |
… | …0101000101010000100 |
3 | 100212221222010120010110 |
4 | 1200110230220222010 |
5 | 3143304133212132 |
6 | 115302523553020 |
7 | 10321001256441 |
oct | 1402454505204 |
9 | 325858116113 |
10 | 103426460292 |
11 | 3a9545a4471 |
12 | 1806538b770 |
13 | 99a366b33c |
14 | 50121589c8 |
15 | 2a54e6c1cc |
hex | 1814b28a84 |
103426460292 has 48 divisors (see below), whose sum is σ = 242337677120. Its totient is φ = 34331465088.
The previous prime is 103426460281. The next prime is 103426460297. The reversal of 103426460292 is 292064624301.
103426460292 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 103426460292.
It is not an unprimeable number, because it can be changed into a prime (103426460297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5740434 + ... + 5758422.
Almost surely, 2103426460292 is an apocalyptic number.
103426460292 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103426460292 is an abundant number, since it is smaller than the sum of its proper divisors (138911216828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103426460292 is a wasteful number, since it uses less digits than its factorization.
103426460292 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19972 (or 19970 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 39.
The spelling of 103426460292 in words is "one hundred three billion, four hundred twenty-six million, four hundred sixty thousand, two hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •