Base | Representation |
---|---|
bin | 10010110100100000… |
… | …00101011000111100 |
3 | 222002011122111001012 |
4 | 21122100011120330 |
5 | 131143122203122 |
6 | 4350341534352 |
7 | 505250302460 |
oct | 113220053074 |
9 | 28064574035 |
10 | 10104100412 |
11 | 431555720a |
12 | 1b5ba143b8 |
13 | c50438453 |
14 | 6bbd004a0 |
15 | 3e20c27e2 |
hex | 25a40563c |
10104100412 has 48 divisors (see below), whose sum is σ = 20605777920. Its totient is φ = 4245264192.
The previous prime is 10104100411. The next prime is 10104100427. The reversal of 10104100412 is 21400140101.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10104100411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3006389 + ... + 3009747.
It is an arithmetic number, because the mean of its divisors is an integer number (429287040).
Almost surely, 210104100412 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10104100412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10302888960).
10104100412 is an abundant number, since it is smaller than the sum of its proper divisors (10501677508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10104100412 is a wasteful number, since it uses less digits than its factorization.
10104100412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5450 (or 5448 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10104100412 its reverse (21400140101), we get a palindrome (31504240513).
The spelling of 10104100412 in words is "ten billion, one hundred four million, one hundred thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •