Base | Representation |
---|---|
bin | 10100011010000110001… |
… | …010000011110010111110 |
3 | 11222001212101001200220120 |
4 | 110122012022003302332 |
5 | 140434113442404210 |
6 | 2552131443555410 |
7 | 203215013233032 |
oct | 24320612036276 |
9 | 4861771050816 |
10 | 1402410122430 |
11 | 4a0838a53a09 |
12 | 1a796838bb66 |
13 | a2329028015 |
14 | 4bc3c7421c2 |
15 | 2672ea35270 |
hex | 14686283cbe |
1402410122430 has 32 divisors (see below), whose sum is σ = 3380482058400. Its totient is φ = 372342947712.
The previous prime is 1402410122419. The next prime is 1402410122447. The reversal of 1402410122430 is 342210142041.
It is a self number, because there is not a number n which added to its sum of digits gives 1402410122430.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102060825 + ... + 102074564.
It is an arithmetic number, because the mean of its divisors is an integer number (105640064325).
Almost surely, 21402410122430 is an apocalyptic number.
1402410122430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1402410122430 is an abundant number, since it is smaller than the sum of its proper divisors (1978071935970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1402410122430 is a wasteful number, since it uses less digits than its factorization.
1402410122430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204135628.
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 1402410122430 its reverse (342210142041), we get a palindrome (1744620264471).
The spelling of 1402410122430 in words is "one trillion, four hundred two billion, four hundred ten million, one hundred twenty-two thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •