Base | Representation |
---|---|
bin | 101111110000000011001001… |
… | …100010101001110111011100 |
3 | 1000112120202210002221202022011 |
4 | 233300003021202221313130 |
5 | 210011301142131210022 |
6 | 2022353150432001004 |
7 | 62143505052232336 |
oct | 5760031142516734 |
9 | 1015522702852264 |
10 | 210010102210012 |
11 | 60a08869822265 |
12 | 1b679446390164 |
13 | 9024b38340260 |
14 | 39c07866c0456 |
15 | 1942ca0d2e977 |
hex | bf00c98a9ddc |
210010102210012 has 48 divisors (see below), whose sum is σ = 396297562530240. Its totient is φ = 96803022500352.
The previous prime is 210010102210003. The next prime is 210010102210099. The reversal of 210010102210012 is 210012201010012.
210010102210012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 210010102209974 and 210010102210001.
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, 1747591953 + ... + 1747712119.
It is an arithmetic number, because the mean of its divisors is an integer number (8256199219380).
Almost surely, 2210010102210012 is an apocalyptic number.
It is an amenable number.
210010102210012 is a deficient number, since it is larger than the sum of its proper divisors (186287460320228).
210010102210012 is a wasteful number, since it uses less digits than its factorization.
210010102210012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163150 (or 163148 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210010102210012 its reverse (210012201010012), we get a palindrome (420022303220024).
The spelling of 210010102210012 in words is "two hundred ten trillion, ten billion, one hundred two million, two hundred ten thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •