Base | Representation |
---|---|
bin | 1100001110110011101… |
… | …0001111100100100111 |
3 | 202002101112112120202000 |
4 | 3003230322033210213 |
5 | 11420323034340234 |
6 | 240311150020343 |
7 | 21116203026522 |
oct | 3035472174447 |
9 | 662345476660 |
10 | 210133121319 |
11 | 8113173a230 |
12 | 348851a76b3 |
13 | 16a7a778a54 |
14 | a255bb7bb9 |
15 | 56ecd7a899 |
hex | 30ece8f927 |
210133121319 has 32 divisors (see below), whose sum is σ = 339870746880. Its totient is φ = 127255284000.
The previous prime is 210133121279. The next prime is 210133121327. The reversal of 210133121319 is 913121331012.
210133121319 is a `hidden beast` number, since 2 + 10 + 1 + 331 + 2 + 1 + 319 = 666.
It is not a de Polignac number, because 210133121319 - 212 = 210133117223 is a prime.
It is a super-2 number, since 2×2101331213192 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 210133121292 and 210133121301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210133121719) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 114484 + ... + 658310.
It is an arithmetic number, because the mean of its divisors is an integer number (10620960840).
Almost surely, 2210133121319 is an apocalyptic number.
210133121319 is a deficient number, since it is larger than the sum of its proper divisors (129737625561).
210133121319 is a wasteful number, since it uses less digits than its factorization.
210133121319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 545148 (or 545142 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The spelling of 210133121319 in words is "two hundred ten billion, one hundred thirty-three million, one hundred twenty-one thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •