Base | Representation |
---|---|
bin | 1011101001000110101… |
… | …0000100011001111111 |
3 | 201010021012021112020011 |
4 | 2322101222010121333 |
5 | 11234111112020111 |
6 | 231515004004051 |
7 | 20310326550631 |
oct | 2722152043177 |
9 | 633235245204 |
10 | 200012220031 |
11 | 779087582a8 |
12 | 3291b830627 |
13 | 15b26a0a370 |
14 | 9975982a51 |
15 | 530958a021 |
hex | 2e91a8467f |
200012220031 has 12 divisors (see below), whose sum is σ = 227331175512. Its totient is φ = 174909467664.
The previous prime is 200012219999. The next prime is 200012220041. The reversal of 200012220031 is 130022210002.
It is not a de Polignac number, because 200012220031 - 25 = 200012219999 is a prime.
It is a super-2 number, since 2×2000122200312 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200012219993 and 200012220020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200012220041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21304941 + ... + 21314326.
It is an arithmetic number, because the mean of its divisors is an integer number (18944264626).
Almost surely, 2200012220031 is an apocalyptic number.
200012220031 is a deficient number, since it is larger than the sum of its proper divisors (27318955481).
200012220031 is a wasteful number, since it uses less digits than its factorization.
200012220031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42619318 (or 42619299 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 200012220031 its reverse (130022210002), we get a palindrome (330034430033).
The spelling of 200012220031 in words is "two hundred billion, twelve million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •