Base | Representation |
---|---|
bin | 11101011110111010101… |
… | …11011011111011011000 |
3 | 10120211210212222010211221 |
4 | 32233131113123323120 |
5 | 113044141443114000 |
6 | 2053214034501424 |
7 | 133121600214556 |
oct | 16573527337330 |
9 | 3524725863757 |
10 | 1013031223000 |
11 | 360695796685 |
12 | 1443ba134874 |
13 | 746b3c80094 |
14 | 37060dbcbd6 |
15 | 1b5407d461a |
hex | ebdd5dbed8 |
1013031223000 has 128 divisors (see below), whose sum is σ = 2409417316800. Its totient is φ = 398576640000.
The previous prime is 1013031222977. The next prime is 1013031223003. The reversal of 1013031223000 is 3221303101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1013031223003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46956216 + ... + 46977784.
Almost surely, 21013031223000 is an apocalyptic number.
1013031223000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1013031223000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1204708658400).
1013031223000 is an abundant number, since it is smaller than the sum of its proper divisors (1396386093800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1013031223000 is a wasteful number, since it uses less digits than its factorization.
1013031223000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22358 (or 22344 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 1013031223000 its reverse (3221303101), we get a palindrome (1016252526101).
The spelling of 1013031223000 in words is "one trillion, thirteen billion, thirty-one million, two hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •