Base | Representation |
---|---|
bin | 11110110110011010100… |
… | …10010111111001111000 |
3 | 10202100001122111011200102 |
4 | 33123031102113321320 |
5 | 114331343030204400 |
6 | 2130543213254532 |
7 | 136403640122516 |
oct | 17331522277170 |
9 | 3670048434612 |
10 | 1060006100600 |
11 | 37960089a477 |
12 | 151529a94448 |
13 | 78c5c080745 |
14 | 39439a474b6 |
15 | 1c88e7c19d5 |
hex | f6cd497e78 |
1060006100600 has 24 divisors (see below), whose sum is σ = 2464514184360. Its totient is φ = 424002440160.
The previous prime is 1060006100581. The next prime is 1060006100617. The reversal of 1060006100600 is 60016000601.
It is a super-2 number, since 2×10600061006002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2650015052 + ... + 2650015451.
It is an arithmetic number, because the mean of its divisors is an integer number (102688091015).
Almost surely, 21060006100600 is an apocalyptic number.
1060006100600 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1060006100600 is an abundant number, since it is smaller than the sum of its proper divisors (1404508083760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1060006100600 is a wasteful number, since it uses less digits than its factorization.
1060006100600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5300030519 (or 5300030510 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Subtracting from 1060006100600 its reverse (60016000601), we obtain a palindrome (999990099999).
The spelling of 1060006100600 in words is "one trillion, sixty billion, six million, one hundred thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •