Base | Representation |
---|---|
bin | 10100000010001011000… |
… | …101001000001111100110 |
3 | 11212121120012001012221000 |
4 | 110002023011020033212 |
5 | 140024012031142410 |
6 | 2532242513534130 |
7 | 201315322446261 |
oct | 24021305101746 |
9 | 4777505035830 |
10 | 1376722912230 |
11 | 490957213776 |
12 | 1a2999874346 |
13 | 9ca9430ca63 |
14 | 4a8c2dcdcd8 |
15 | 25c29869dc0 |
hex | 1408b1483e6 |
1376722912230 has 96 divisors (see below), whose sum is σ = 3802222288800. Its totient is φ = 354466530432.
The previous prime is 1376722912219. The next prime is 1376722912231. The reversal of 1376722912230 is 322192276731.
1376722912230 is a `hidden beast` number, since 1 + 3 + 76 + 72 + 291 + 223 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1376722912231) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2804425 + ... + 3258564.
It is an arithmetic number, because the mean of its divisors is an integer number (39606482175).
Almost surely, 21376722912230 is an apocalyptic number.
1376722912230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1376722912230 is an abundant number, since it is smaller than the sum of its proper divisors (2425499376570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1376722912230 is a wasteful number, since it uses less digits than its factorization.
1376722912230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6063063 (or 6063028 counting only the distinct ones).
The product of its (nonzero) digits is 381024, while the sum is 45.
The spelling of 1376722912230 in words is "one trillion, three hundred seventy-six billion, seven hundred twenty-two million, nine hundred twelve thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •