Base | Representation |
---|---|
bin | 10011101100001100011… |
… | …010110011011000001111 |
3 | 11210100122110202001110102 |
4 | 103230030122303120033 |
5 | 134132144000113043 |
6 | 2513341031001315 |
7 | 166521436106222 |
oct | 23541432633017 |
9 | 4710573661412 |
10 | 1353123051023 |
11 | 481946760747 |
12 | 19a2b220923b |
13 | 9a7a2ba3243 |
14 | 496c49935b9 |
15 | 252e7a686b8 |
hex | 13b0c6b360f |
1353123051023 has 4 divisors (see below), whose sum is σ = 1411954488048. Its totient is φ = 1294291614000.
The previous prime is 1353123051017. The next prime is 1353123051151. The reversal of 1353123051023 is 3201503213531.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1353123051023 - 212 = 1353123046927 is a prime.
It is a super-2 number, since 2×13531230510232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1353123051923) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29415718478 + ... + 29415718523.
It is an arithmetic number, because the mean of its divisors is an integer number (352988622012).
Almost surely, 21353123051023 is an apocalyptic number.
1353123051023 is a deficient number, since it is larger than the sum of its proper divisors (58831437025).
1353123051023 is an equidigital number, since it uses as much as digits as its factorization.
1353123051023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58831437024.
The product of its (nonzero) digits is 8100, while the sum is 29.
Adding to 1353123051023 its reverse (3201503213531), we get a palindrome (4554626264554).
The spelling of 1353123051023 in words is "one trillion, three hundred fifty-three billion, one hundred twenty-three million, fifty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •