Base | Representation |
---|---|
bin | 101111111010101000000110… |
… | …011001100110111110010100 |
3 | 1000122011020221222001121000022 |
4 | 233322220012121212332110 |
5 | 210110203310004101233 |
6 | 2024111121225404312 |
7 | 62250146431523222 |
oct | 5772500631467624 |
9 | 1018136858047008 |
10 | 210736972722068 |
11 | 61169059222311 |
12 | 1b7762a1939698 |
13 | 90785466c1370 |
14 | 3a07a1c55bb12 |
15 | 1956b43de0398 |
hex | bfaa06666f94 |
210736972722068 has 24 divisors (see below), whose sum is σ = 397158553176168. Its totient is φ = 97263117213696.
The previous prime is 210736972722019. The next prime is 210736972722091. The reversal of 210736972722068 is 860227279637012.
It can be written as a sum of positive squares in 4 ways, for example, as 56114661504784 + 154622311217284 = 7490972^2 + 12434722^2 .
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 210736972722068.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76312280 + ... + 79025552.
It is an arithmetic number, because the mean of its divisors is an integer number (16548273049007).
Almost surely, 2210736972722068 is an apocalyptic number.
It is an amenable number.
210736972722068 is a deficient number, since it is larger than the sum of its proper divisors (186421580454100).
210736972722068 is a wasteful number, since it uses less digits than its factorization.
210736972722068 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4206923 (or 4206921 counting only the distinct ones).
The product of its (nonzero) digits is 42674688, while the sum is 62.
The spelling of 210736972722068 in words is "two hundred ten trillion, seven hundred thirty-six billion, nine hundred seventy-two million, seven hundred twenty-two thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •