Base | Representation |
---|---|
bin | 1100010001111100101… |
… | …1000111111111000101 |
3 | 202011120022022221220021 |
4 | 3010133023013333011 |
5 | 11424034430014433 |
6 | 240530552335141 |
7 | 21146122606015 |
oct | 3043713077705 |
9 | 664508287807 |
10 | 210976407493 |
11 | 81524755655 |
12 | 34a7b6a44b1 |
13 | 16b833a6157 |
14 | a2d5badc45 |
15 | 574be0322d |
hex | 311f2c7fc5 |
210976407493 has 8 divisors (see below), whose sum is σ = 222114326720. Its totient is φ = 199841878080.
The previous prime is 210976407469. The next prime is 210976407497. The reversal of 210976407493 is 394704679012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210976407493 - 25 = 210976407461 is a prime.
It is a super-4 number, since 4×2109764074934 (a number of 46 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 210976407493.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210976407497) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 719193 + ... + 969118.
It is an arithmetic number, because the mean of its divisors is an integer number (27764290840).
Almost surely, 2210976407493 is an apocalyptic number.
It is an amenable number.
210976407493 is a deficient number, since it is larger than the sum of its proper divisors (11137919227).
210976407493 is a wasteful number, since it uses less digits than its factorization.
210976407493 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1694907.
The product of its (nonzero) digits is 2286144, while the sum is 52.
The spelling of 210976407493 in words is "two hundred ten billion, nine hundred seventy-six million, four hundred seven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •