Base | Representation |
---|---|
bin | 101111101000100111… |
… | …1111000111101010100 |
3 | 100210001002210212120110 |
4 | 1133101033320331110 |
5 | 3133444440221122 |
6 | 114554341403020 |
7 | 10250650614255 |
oct | 1372117707524 |
9 | 323032725513 |
10 | 102294851412 |
11 | 3a42385aa16 |
12 | 179aa409470 |
13 | 98530a12a0 |
14 | 4d45b4cb2c |
15 | 29da94090c |
hex | 17d13f8f54 |
102294851412 has 96 divisors (see below), whose sum is σ = 270733921920. Its totient is φ = 29801502720.
The previous prime is 102294851369. The next prime is 102294851467. The reversal of 102294851412 is 214158492201.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5661112 + ... + 5679152.
It is an arithmetic number, because the mean of its divisors is an integer number (2820145020).
Almost surely, 2102294851412 is an apocalyptic number.
102294851412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102294851412, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135366960960).
102294851412 is an abundant number, since it is smaller than the sum of its proper divisors (168439070508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102294851412 is a wasteful number, since it uses less digits than its factorization.
102294851412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19993 (or 19991 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 39.
The spelling of 102294851412 in words is "one hundred two billion, two hundred ninety-four million, eight hundred fifty-one thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •