Base | Representation |
---|---|
bin | 10001101001101100011… |
… | …100100011011101110100 |
3 | 11021221222001212210200010 |
4 | 101221230130203131310 |
5 | 124333211022431400 |
6 | 2325124500020220 |
7 | 153431163411621 |
oct | 21515434433564 |
9 | 4257861783603 |
10 | 1213000202100 |
11 | 428480a9a375 |
12 | 177107391670 |
13 | 8a501a2a69b |
14 | 429d0d07348 |
15 | 2184617c450 |
hex | 11a6c723774 |
1213000202100 has 72 divisors (see below), whose sum is σ = 3694330457440. Its totient is φ = 306442154880.
The previous prime is 1213000202093. The next prime is 1213000202107. The reversal of 1213000202100 is 12020003121.
It is an interprime number because it is at equal distance from previous prime (1213000202093) and next prime (1213000202107).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1213000202107) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 106397827 + ... + 106409226.
Almost surely, 21213000202100 is an apocalyptic number.
1213000202100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1213000202100 is an abundant number, since it is smaller than the sum of its proper divisors (2481330255340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1213000202100 is a wasteful number, since it uses less digits than its factorization.
1213000202100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212807089 (or 212807082 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1213000202100 its reverse (12020003121), we get a palindrome (1225020205221).
The spelling of 1213000202100 in words is "one trillion, two hundred thirteen billion, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •