Base | Representation |
---|---|
bin | 11101110001111101110… |
… | …00000110001100000000 |
3 | 10121211012112202222122122 |
4 | 32320332320012030000 |
5 | 113231112304443443 |
6 | 2102024451023412 |
7 | 133633156630163 |
oct | 16707670061400 |
9 | 3554175688578 |
10 | 1023257109248 |
11 | 364a62a64340 |
12 | 14639289ab68 |
13 | 756536b924a |
14 | 37751141ada |
15 | 1b93d411968 |
hex | ee3ee06300 |
1023257109248 has 72 divisors (see below), whose sum is σ = 2229579992640. Its totient is φ = 464828912640.
The previous prime is 1023257109227. The next prime is 1023257109253. The reversal of 1023257109248 is 8429017523201.
It is a super-2 number, since 2×10232571092482 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a junction number, because it is equal to n+sod(n) for n = 1023257109199 and 1023257109208.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4469963 + ... + 4693301.
Almost surely, 21023257109248 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1023257109248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1114789996320).
1023257109248 is an abundant number, since it is smaller than the sum of its proper divisors (1206322883392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023257109248 is a wasteful number, since it uses less digits than its factorization.
1023257109248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 224993 (or 224979 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 44.
The spelling of 1023257109248 in words is "one trillion, twenty-three billion, two hundred fifty-seven million, one hundred nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •