Base | Representation |
---|---|
bin | 10011010110110111111… |
… | …000110010000010010000 |
3 | 11201011120000110002000011 |
4 | 103112313320302002100 |
5 | 133243302340310000 |
6 | 2455033233404304 |
7 | 165051224344333 |
oct | 23266770620220 |
9 | 4634500402004 |
10 | 1330230010000 |
11 | 473169186131 |
12 | 195983409694 |
13 | 98595023218 |
14 | 4855238861a |
15 | 24907d352ba |
hex | 135b7e32090 |
1330230010000 has 50 divisors (see below), whose sum is σ = 3220619901422. Its totient is φ = 532092000000.
The previous prime is 1330230009893. The next prime is 1330230010027. The reversal of 1330230010000 is 100320331.
It can be written as a sum of positive squares in 5 ways, for example, as 817642743696 + 512587266304 = 904236^2 + 715952^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 66501501 + ... + 66521500.
Almost surely, 21330230010000 is an apocalyptic number.
1330230010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1330230010000 is an abundant number, since it is smaller than the sum of its proper divisors (1890389891422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330230010000 is an equidigital number, since it uses as much as digits as its factorization.
1330230010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133023029 (or 133023008 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 1330230010000 its reverse (100320331), we get a palindrome (1330330330331).
The spelling of 1330230010000 in words is "one trillion, three hundred thirty billion, two hundred thirty million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •