Base | Representation |
---|---|
bin | 1001011101011110110101… |
… | …1111101000000000010101 |
3 | 1100211102122020220122011112 |
4 | 2113113231133220000111 |
5 | 2330412000140023013 |
6 | 34042354154144405 |
7 | 2122345512541163 |
oct | 227275537500025 |
9 | 40742566818145 |
10 | 10402100314133 |
11 | 3350562499520 |
12 | 11bbbb6422105 |
13 | 5a5bb5964698 |
14 | 27d670220233 |
15 | 1308b0e16ba8 |
hex | 975ed7e8015 |
10402100314133 has 16 divisors (see below), whose sum is σ = 11617661164032. Its totient is φ = 9231753174000.
The previous prime is 10402100314093. The next prime is 10402100314189. The reversal of 10402100314133 is 33141300120401.
It is a cyclic number.
It is not a de Polignac number, because 10402100314133 - 224 = 10402083536917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10402100314099 and 10402100314108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10402100314733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4781033 + ... + 6607758.
It is an arithmetic number, because the mean of its divisors is an integer number (726103822752).
Almost surely, 210402100314133 is an apocalyptic number.
It is an amenable number.
10402100314133 is a deficient number, since it is larger than the sum of its proper divisors (1215560849899).
10402100314133 is a wasteful number, since it uses less digits than its factorization.
10402100314133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11390776.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10402100314133 its reverse (33141300120401), we get a palindrome (43543400434534).
The spelling of 10402100314133 in words is "ten trillion, four hundred two billion, one hundred million, three hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •