Base | Representation |
---|---|
bin | 10100011001110011101… |
… | …011001000010000001011 |
3 | 11222001001202120002021210 |
4 | 110121303223020100023 |
5 | 140433000101234311 |
6 | 2552041005304203 |
7 | 203204226364656 |
oct | 24316353102013 |
9 | 4861052502253 |
10 | 1402100024331 |
11 | 4a0699a02696 |
12 | 1a78a0565063 |
13 | a22a9a02b16 |
14 | 4bc0d4a089d |
15 | 267126ce3a6 |
hex | 14673ac840b |
1402100024331 has 8 divisors (see below), whose sum is σ = 1869486921424. Its totient is φ = 934723238400.
The previous prime is 1402100024263. The next prime is 1402100024363. The reversal of 1402100024331 is 1334200012041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1402100024331 - 218 = 1402099762187 is a prime.
It is a super-2 number, since 2×14021000243312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1402100024298 and 1402100024307.
It is not an unprimeable number, because it can be changed into a prime (1402100024131) 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, 2198086 + ... + 2763291.
It is an arithmetic number, because the mean of its divisors is an integer number (233685865178).
Almost surely, 21402100024331 is an apocalyptic number.
1402100024331 is a deficient number, since it is larger than the sum of its proper divisors (467386897093).
1402100024331 is an equidigital number, since it uses as much as digits as its factorization.
1402100024331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5055581.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1402100024331 its reverse (1334200012041), we get a palindrome (2736300036372).
The spelling of 1402100024331 in words is "one trillion, four hundred two billion, one hundred million, twenty-four thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •