Base | Representation |
---|---|
bin | 10011010110101011011… |
… | …011011110100000000111 |
3 | 11201011000110011022212100 |
4 | 103112223123132200013 |
5 | 133242340334014343 |
6 | 2455000405523143 |
7 | 165043105656315 |
oct | 23265333364007 |
9 | 4634013138770 |
10 | 1330021001223 |
11 | 4730711aa802 |
12 | 1959254134b3 |
13 | 985609335a5 |
14 | 485326dd0b5 |
15 | 248e47eb9d3 |
hex | 135ab6de807 |
1330021001223 has 12 divisors (see below), whose sum is σ = 1923001228720. Its totient is φ = 885822306336.
The previous prime is 1330021001203. The next prime is 1330021001233. The reversal of 1330021001223 is 3221001200331.
1330021001223 is a `hidden beast` number, since 1 + 330 + 0 + 210 + 0 + 122 + 3 = 666.
It is not a de Polignac number, because 1330021001223 - 26 = 1330021001159 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1330021001196 and 1330021001205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330021001203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71520283 + ... + 71538876.
Almost surely, 21330021001223 is an apocalyptic number.
1330021001223 is a deficient number, since it is larger than the sum of its proper divisors (592980227497).
1330021001223 is a wasteful number, since it uses less digits than its factorization.
1330021001223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143060198 (or 143060195 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1330021001223 its reverse (3221001200331), we get a palindrome (4551022201554).
It can be divided in two parts, 133002 and 1001223, that added together give a square (1134225 = 10652).
The spelling of 1330021001223 in words is "one trillion, three hundred thirty billion, twenty-one million, one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •