Base | Representation |
---|---|
bin | 10111010000110110101101… |
… | …110111101101100101001000 |
3 | 111102021001121002112001101111 |
4 | 113100312231313231211020 |
5 | 101402300201223133000 |
6 | 1001334032445500104 |
7 | 30356615525320213 |
oct | 2720665567554510 |
9 | 442231532461344 |
10 | 102313333021000 |
11 | 2a666928207282 |
12 | b585014271634 |
13 | 451214b89a74a |
14 | 1b39dc549a77a |
15 | bc6610740cba |
hex | 5d0dadded948 |
102313333021000 has 64 divisors (see below), whose sum is σ = 239423402116080. Its totient is φ = 40923589132800.
The previous prime is 102313333020911. The next prime is 102313333021019. The reversal of 102313333021000 is 120333313201.
It can be written as a sum of positive squares in 8 ways, for example, as 19996798481284 + 82316534539716 = 4471778^2 + 9072846^2 .
It is a super-2 number, since 2×1023133330210002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21424702 + ... + 25761298.
Almost surely, 2102313333021000 is an apocalyptic number.
102313333021000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102313333021000 is an abundant number, since it is smaller than the sum of its proper divisors (137110069095080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102313333021000 is a wasteful number, since it uses less digits than its factorization.
102313333021000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4360211 (or 4360197 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 102313333021000 its reverse (120333313201), we get a palindrome (102433666334201).
The spelling of 102313333021000 in words is "one hundred two trillion, three hundred thirteen billion, three hundred thirty-three million, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •