Base | Representation |
---|---|
bin | 10100011001111111101… |
… | …101110001010010111100 |
3 | 11222001120211200201020201 |
4 | 110121333231301102330 |
5 | 140433403310341244 |
6 | 2552113023253244 |
7 | 203212231461430 |
oct | 24317755612274 |
9 | 4861524621221 |
10 | 1402302043324 |
11 | 4a0792a44536 |
12 | 1a793814a224 |
13 | a230c8160a0 |
14 | 4bc2c24a9c0 |
15 | 267252d6ad4 |
hex | 1467fb714bc |
1402302043324 has 48 divisors (see below), whose sum is σ = 3021979580928. Its totient is φ = 554456230848.
The previous prime is 1402302043309. The next prime is 1402302043333. The reversal of 1402302043324 is 4233402032041.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 1402302043292 and 1402302043301.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 370594 + ... + 1715209.
It is an arithmetic number, because the mean of its divisors is an integer number (62957907936).
Almost surely, 21402302043324 is an apocalyptic number.
1402302043324 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1402302043324 is an abundant number, since it is smaller than the sum of its proper divisors (1619677537604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1402302043324 is a wasteful number, since it uses less digits than its factorization.
1402302043324 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2087674 (or 2087672 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 1402302043324 its reverse (4233402032041), we get a palindrome (5635704075365).
The spelling of 1402302043324 in words is "one trillion, four hundred two billion, three hundred two million, forty-three thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •