Base | Representation |
---|---|
bin | 10100011000111111001… |
… | …110110000010011110111 |
3 | 11221221210102221220102100 |
4 | 110120333032300103313 |
5 | 140424144330432444 |
6 | 2551413415113143 |
7 | 203143353635625 |
oct | 24307716602367 |
9 | 4857712856370 |
10 | 1401220170999 |
11 | 4a0288290880 |
12 | 1a76959727b3 |
13 | a219964154c |
14 | 4bb686aa515 |
15 | 266b0331e69 |
hex | 1463f3b04f7 |
1401220170999 has 48 divisors (see below), whose sum is σ = 2315410325280. Its totient is φ = 808708561920.
The previous prime is 1401220170989. The next prime is 1401220171027. The reversal of 1401220170999 is 9990710221041.
It is a happy number.
1401220170999 is a `hidden beast` number, since 1 + 401 + 220 + 17 + 0 + 9 + 9 + 9 = 666.
It is not a de Polignac number, because 1401220170999 - 28 = 1401220170743 is a prime.
It is a super-2 number, since 2×14012201709992 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1401220170919) 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 47 ways as a sum of consecutive naturals, for example, 3133294 + ... + 3552459.
It is an arithmetic number, because the mean of its divisors is an integer number (48237715110).
Almost surely, 21401220170999 is an apocalyptic number.
1401220170999 is a deficient number, since it is larger than the sum of its proper divisors (914190154281).
1401220170999 is a wasteful number, since it uses less digits than its factorization.
1401220170999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6685872 (or 6685869 counting only the distinct ones).
The product of its (nonzero) digits is 81648, while the sum is 45.
The spelling of 1401220170999 in words is "one trillion, four hundred one billion, two hundred twenty million, one hundred seventy thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •