Base | Representation |
---|---|
bin | 11111111011110101011111… |
… | …11010110010001011000110 |
3 | 100012122111201110100112101200 |
4 | 33331322233322302023012 |
5 | 33201034131134243022 |
6 | 405205120444203330 |
7 | 20535431326031655 |
oct | 1775725772621306 |
9 | 305574643315350 |
10 | 70225666712262 |
11 | 204155a1097116 |
12 | 7a62255839546 |
13 | 3025337715189 |
14 | 134ad2468119c |
15 | 81bae6436bac |
hex | 3fdeafeb22c6 |
70225666712262 has 96 divisors (see below), whose sum is σ = 160528709752320. Its totient is φ = 22126011969600.
The previous prime is 70225666712249. The next prime is 70225666712273. The reversal of 70225666712262 is 26221766652207.
It is a junction number, because it is equal to n+sod(n) for n = 70225666712199 and 70225666712208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1677971637 + ... + 1678013487.
It is an arithmetic number, because the mean of its divisors is an integer number (1672174059920).
Almost surely, 270225666712262 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70225666712262, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80264354876160).
70225666712262 is an abundant number, since it is smaller than the sum of its proper divisors (90303043040058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70225666712262 is a wasteful number, since it uses less digits than its factorization.
70225666712262 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52938 (or 52935 counting only the distinct ones).
The product of its (nonzero) digits is 10160640, while the sum is 54.
The spelling of 70225666712262 in words is "seventy trillion, two hundred twenty-five billion, six hundred sixty-six million, seven hundred twelve thousand, two hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •