Base | Representation |
---|---|
bin | 10100011001011010101… |
… | …101100001011100110110 |
3 | 11221222222120111200201020 |
4 | 110121122231201130312 |
5 | 140431120343041210 |
6 | 2551531245042010 |
7 | 203160652541160 |
oct | 24313255413466 |
9 | 4858876450636 |
10 | 1401681221430 |
11 | 4a04a4564896 |
12 | 1a77a4256306 |
13 | a2241009c59 |
14 | 4bbada03930 |
15 | 266daa54770 |
hex | 1465ab61736 |
1401681221430 has 32 divisors (see below), whose sum is σ = 3844611350784. Its totient is φ = 320384279136.
The previous prime is 1401681221429. The next prime is 1401681221431. The reversal of 1401681221430 is 341221861041.
It is an interprime number because it is at equal distance from previous prime (1401681221429) and next prime (1401681221431).
It is a junction number, because it is equal to n+sod(n) for n = 1401681221391 and 1401681221400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401681221431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3337336032 + ... + 3337336451.
It is an arithmetic number, because the mean of its divisors is an integer number (120144104712).
Almost surely, 21401681221430 is an apocalyptic number.
1401681221430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1401681221430 is an abundant number, since it is smaller than the sum of its proper divisors (2442930129354).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1401681221430 is a wasteful number, since it uses less digits than its factorization.
1401681221430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6674672500.
The product of its (nonzero) digits is 9216, while the sum is 33.
The spelling of 1401681221430 in words is "one trillion, four hundred one billion, six hundred eighty-one million, two hundred twenty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •