Base | Representation |
---|---|
bin | 1100001111010… |
… | …01101100010000 |
3 | 21011012010111020 |
4 | 12013221230100 |
5 | 202240402242 |
6 | 14104315440 |
7 | 2354446512 |
oct | 607515420 |
9 | 234163436 |
10 | 102669072 |
11 | 52a54880 |
12 | 2a472b80 |
13 | 1836963c |
14 | d8c7bb2 |
15 | 90306ec |
hex | 61e9b10 |
102669072 has 80 divisors (see below), whose sum is σ = 290701632. Its totient is φ = 30965760.
The previous prime is 102669071. The next prime is 102669101. The reversal of 102669072 is 270966201.
It is a super-4 number, since 4×1026690724 (a number of 33 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (102669071) 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, 177648 + ... + 178224.
Almost surely, 2102669072 is an apocalyptic number.
102669072 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 102669072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145350816).
102669072 is an abundant number, since it is smaller than the sum of its proper divisors (188032560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102669072 is a wasteful number, since it uses less digits than its factorization.
102669072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 936 (or 930 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 33.
The square root of 102669072 is about 10132.5747961710. The cubic root of 102669072 is about 468.2522564388.
The spelling of 102669072 in words is "one hundred two million, six hundred sixty-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •