Base | Representation |
---|---|
bin | 10011111101001111110… |
… | …011010001000011001110 |
3 | 11212002220112220111101200 |
4 | 103331033303101003032 |
5 | 134432143423003140 |
6 | 2530010001250330 |
7 | 201040253421255 |
oct | 23751763210316 |
9 | 4762815814350 |
10 | 1371433406670 |
11 | 48969244a978 |
12 | 1a19623339a6 |
13 | 9c4304b9002 |
14 | 4a5406cb79c |
15 | 25a1a2c9030 |
hex | 13f4fcd10ce |
1371433406670 has 48 divisors (see below), whose sum is σ = 3569532548400. Its totient is φ = 365325247872.
The previous prime is 1371433406669. The next prime is 1371433406699. The reversal of 1371433406670 is 766043341731.
1371433406670 is a `hidden beast` number, since 1 + 37 + 143 + 3 + 406 + 6 + 70 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8047020 + ... + 8215679.
It is an arithmetic number, because the mean of its divisors is an integer number (74365261425).
Almost surely, 21371433406670 is an apocalyptic number.
1371433406670 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1371433406670 is an abundant number, since it is smaller than the sum of its proper divisors (2198099141730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1371433406670 is a wasteful number, since it uses less digits than its factorization.
1371433406670 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16263649 (or 16263646 counting only the distinct ones).
The product of its (nonzero) digits is 762048, while the sum is 45.
The spelling of 1371433406670 in words is "one trillion, three hundred seventy-one billion, four hundred thirty-three million, four hundred six thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •