Base | Representation |
---|---|
bin | 10100100100111100001… |
… | …000001100011011011010 |
3 | 12000011220210020020202000 |
4 | 110210330020030123122 |
5 | 141131440033141102 |
6 | 3001335035421430 |
7 | 204106360235640 |
oct | 24447410143332 |
9 | 5004823206660 |
10 | 1414053021402 |
11 | 4a577308026a |
12 | 1aa0775b4876 |
13 | a34631bb458 |
14 | 4c624b65190 |
15 | 26bb1c6801c |
hex | 1493c20c6da |
1414053021402 has 64 divisors (see below), whose sum is σ = 3591422115840. Its totient is φ = 403995310128.
The previous prime is 1414053021401. The next prime is 1414053021413. The reversal of 1414053021402 is 2041203504141.
1414053021402 is a `hidden beast` number, since 1 + 41 + 405 + 3 + 0 + 214 + 0 + 2 = 666.
It is a super-2 number, since 2×14140530214022 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1414053021401) 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, 8737423 + ... + 8897789.
It is an arithmetic number, because the mean of its divisors is an integer number (56115970560).
Almost surely, 21414053021402 is an apocalyptic number.
1414053021402 is an abundant number, since it is smaller than the sum of its proper divisors (2177369094438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1414053021402 is a wasteful number, since it uses less digits than its factorization.
1414053021402 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 183712 (or 183706 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 1414053021402 its reverse (2041203504141), we get a palindrome (3455256525543).
The spelling of 1414053021402 in words is "one trillion, four hundred fourteen billion, fifty-three million, twenty-one thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •