Base | Representation |
---|---|
bin | 10100011010001101111… |
… | …101010101101010001100 |
3 | 11222002012111100020122220 |
4 | 110122031331111222030 |
5 | 140434400444133302 |
6 | 2552152441135340 |
7 | 203221162562136 |
oct | 24321575255214 |
9 | 4862174306586 |
10 | 1402541005452 |
11 | 4a08a59192a4 |
12 | 1a79a418a550 |
13 | a234a1926b2 |
14 | 4bc51c92056 |
15 | 2673b28a4bc |
hex | 1468df55a8c |
1402541005452 has 12 divisors (see below), whose sum is σ = 3272595679416. Its totient is φ = 467513668480.
The previous prime is 1402541005451. The next prime is 1402541005477. The reversal of 1402541005452 is 2545001452041.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is not an unprimeable number, because it can be changed into a prime (1402541005451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58439208549 + ... + 58439208572.
It is an arithmetic number, because the mean of its divisors is an integer number (272716306618).
Almost surely, 21402541005452 is an apocalyptic number.
1402541005452 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1402541005452 is an abundant number, since it is smaller than the sum of its proper divisors (1870054673964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1402541005452 is a wasteful number, since it uses less digits than its factorization.
1402541005452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116878417128 (or 116878417126 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 33.
Adding to 1402541005452 its reverse (2545001452041), we get a palindrome (3947542457493).
The spelling of 1402541005452 in words is "one trillion, four hundred two billion, five hundred forty-one million, five thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •