Base | Representation |
---|---|
bin | 10011111101001011001… |
… | …101100110001110001100 |
3 | 11212002201012001022201120 |
4 | 103331023031212032030 |
5 | 134432014221014202 |
6 | 2525554211240540 |
7 | 201035330160240 |
oct | 23751315461614 |
9 | 4762635038646 |
10 | 1371356423052 |
11 | 489652a49a50 |
12 | 1a19405a9150 |
13 | 9c41a573885 |
14 | 4a5343ac420 |
15 | 25a1366e0bc |
hex | 13f4b36638c |
1371356423052 has 96 divisors (see below), whose sum is σ = 3990635625984. Its totient is φ = 356086195200.
The previous prime is 1371356423029. The next prime is 1371356423053. The reversal of 1371356423052 is 2503246531731.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 1371356422995 and 1371356423013.
It is not an unprimeable number, because it can be changed into a prime (1371356423053) 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, 2777652 + ... + 3233892.
It is an arithmetic number, because the mean of its divisors is an integer number (41569121104).
Almost surely, 21371356423052 is an apocalyptic number.
1371356423052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1371356423052 is an abundant number, since it is smaller than the sum of its proper divisors (2619279202932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1371356423052 is a wasteful number, since it uses less digits than its factorization.
1371356423052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 459519 (or 459517 counting only the distinct ones).
The product of its (nonzero) digits is 453600, while the sum is 42.
The spelling of 1371356423052 in words is "one trillion, three hundred seventy-one billion, three hundred fifty-six million, four hundred twenty-three thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •