Base | Representation |
---|---|
bin | 11110111111111011000… |
… | …101000110101111011000 |
3 | 21112122110210001210120000 |
4 | 132333323011012233120 |
5 | 234400143113343224 |
6 | 4310335441533000 |
7 | 306621603463653 |
oct | 36777305065730 |
9 | 7478423053500 |
10 | 2130221231064 |
11 | 751470394103 |
12 | 2a4a26944160 |
13 | 125b57217a54 |
14 | 751634a689a |
15 | 3a62a4910c9 |
hex | 1effb146bd8 |
2130221231064 has 80 divisors (see below), whose sum is σ = 5985414507600. Its totient is φ = 707833695168.
The previous prime is 2130221231027. The next prime is 2130221231129. The reversal of 2130221231064 is 4601321220312.
2130221231064 is a `hidden beast` number, since 2 + 130 + 2 + 212 + 310 + 6 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4979724 + ... + 5390555.
It is an arithmetic number, because the mean of its divisors is an integer number (74817681345).
Almost surely, 22130221231064 is an apocalyptic number.
2130221231064 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
2130221231064 is an abundant number, since it is smaller than the sum of its proper divisors (3855193276536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2130221231064 is a wasteful number, since it uses less digits than its factorization.
2130221231064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10370614 (or 10370601 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 2130221231064 its reverse (4601321220312), we get a palindrome (6731542451376).
The spelling of 2130221231064 in words is "two trillion, one hundred thirty billion, two hundred twenty-one million, two hundred thirty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •