Base | Representation |
---|---|
bin | 10111001101001011101000… |
… | …000100100011010000010100 |
3 | 111101100221001001021210201000 |
4 | 113031023220010203100110 |
5 | 101334131214014112034 |
6 | 1001022044431103300 |
7 | 30332441255356101 |
oct | 2715135004432024 |
9 | 441327031253630 |
10 | 102060906394644 |
11 | 2a579872a347aa |
12 | b544107071b30 |
13 | 44c43c0b5c692 |
14 | 1b2baba697aa8 |
15 | bbec89891599 |
hex | 5cd2e8123414 |
102060906394644 has 24 divisors (see below), whose sum is σ = 264602349912320. Its totient is φ = 34020302131512.
The previous prime is 102060906394621. The next prime is 102060906394651. The reversal of 102060906394644 is 446493609060201.
102060906394644 is a `hidden beast` number, since 1 + 0 + 2 + 0 + 60 + 90 + 6 + 39 + 464 + 4 = 666.
It is a super-2 number, since 2×1020609063946442 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 472504196164 + ... + 472504196379.
Almost surely, 2102060906394644 is an apocalyptic number.
It is an amenable number.
102060906394644 is an abundant number, since it is smaller than the sum of its proper divisors (162541443517676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102060906394644 is a wasteful number, since it uses less digits than its factorization.
102060906394644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945008392556 (or 945008392548 counting only the distinct ones).
The product of its (nonzero) digits is 6718464, while the sum is 54.
The spelling of 102060906394644 in words is "one hundred two trillion, sixty billion, nine hundred six million, three hundred ninety-four thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •