Base | Representation |
---|---|
bin | 100010000111100101101010… |
… | …1001010000000011100111100 |
3 | 1110100121020200100001120010020 |
4 | 1010033023111022000130330 |
5 | 303314001011434323004 |
6 | 2542140404123412140 |
7 | 120133145365562223 |
oct | 10417132512003474 |
9 | 1410536610046106 |
10 | 300110121011004 |
11 | 87695a95501a27 |
12 | 297ab428384050 |
13 | cb5c3559c0b65 |
14 | 541759bb19cba |
15 | 24a68463ab8d9 |
hex | 110f2d528073c |
300110121011004 has 12 divisors (see below), whose sum is σ = 700256949025704. Its totient is φ = 100036707003664.
The previous prime is 300110121010991. The next prime is 300110121011011. The reversal of 300110121011004 is 400110121011003.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12504588375447 + ... + 12504588375470.
It is an arithmetic number, because the mean of its divisors is an integer number (58354745752142).
Almost surely, 2300110121011004 is an apocalyptic number.
It is an amenable number.
300110121011004 is an abundant number, since it is smaller than the sum of its proper divisors (400146828014700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300110121011004 is a wasteful number, since it uses less digits than its factorization.
300110121011004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25009176750924 (or 25009176750922 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 300110121011004 its reverse (400110121011003), we get a palindrome (700220242022007).
Subtracting 300110121011004 from its reverse (400110121011003), we obtain a palindrome (99999999999999).
The spelling of 300110121011004 in words is "three hundred trillion, one hundred ten billion, one hundred twenty-one million, eleven thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •