Base | Representation |
---|---|
bin | 10111011101110010100010… |
… | …100010110001010001100000 |
3 | 111112102000220211211122102121 |
4 | 113131302202202301101200 |
5 | 102011331102002241000 |
6 | 1003254234155554024 |
7 | 30511053516301132 |
oct | 2735624242612140 |
9 | 445360824748377 |
10 | 103202201212000 |
11 | 2a979898121220 |
12 | b6a934045b914 |
13 | 4577c0602c207 |
14 | 1b6b0282a1052 |
15 | bde7d5843b1a |
hex | 5ddca28b1460 |
103202201212000 has 96 divisors (see below), whose sum is σ = 276619427439264. Its totient is φ = 37528073152000.
The previous prime is 103202201211973. The next prime is 103202201212043. The reversal of 103202201212000 is 212102202301.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
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, 1172708287 + ... + 1172796286.
It is an arithmetic number, because the mean of its divisors is an integer number (2881452369159).
Almost surely, 2103202201212000 is an apocalyptic number.
103202201212000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103202201212000 is an abundant number, since it is smaller than the sum of its proper divisors (173417226227264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103202201212000 is a wasteful number, since it uses less digits than its factorization.
103202201212000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2345504609 (or 2345504591 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 103202201212000 its reverse (212102202301), we get a palindrome (103414303414301).
The spelling of 103202201212000 in words is "one hundred three trillion, two hundred two billion, two hundred one million, two hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •