Base | Representation |
---|---|
bin | 11101110001101111001… |
… | …00110011111100000100 |
3 | 10121210220000021112201220 |
4 | 32320313210303330010 |
5 | 113230334430111002 |
6 | 2102004353320340 |
7 | 133630141502043 |
oct | 16706744637404 |
9 | 3553800245656 |
10 | 1023134613252 |
11 | 3649aa8a8284 |
12 | 1463598660b0 |
13 | 756341ca1cb |
14 | 3773cb7655a |
15 | 1b9327b67bc |
hex | ee37933f04 |
1023134613252 has 12 divisors (see below), whose sum is σ = 2387314097616. Its totient is φ = 341044871080.
The previous prime is 1023134613143. The next prime is 1023134613299. The reversal of 1023134613252 is 2523164313201.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×10231346132522 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42630608874 + ... + 42630608897.
It is an arithmetic number, because the mean of its divisors is an integer number (198942841468).
Almost surely, 21023134613252 is an apocalyptic number.
1023134613252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1023134613252 is an abundant number, since it is smaller than the sum of its proper divisors (1364179484364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023134613252 is a wasteful number, since it uses less digits than its factorization.
1023134613252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85261217778 (or 85261217776 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 1023134613252 its reverse (2523164313201), we get a palindrome (3546298926453).
The spelling of 1023134613252 in words is "one trillion, twenty-three billion, one hundred thirty-four million, six hundred thirteen thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •