Base | Representation |
---|---|
bin | 10011010110111100111… |
… | …010100001001101001000 |
3 | 11201011202220011001200220 |
4 | 103112330322201031020 |
5 | 133243440433221212 |
6 | 2455045445230040 |
7 | 165053300261613 |
oct | 23267472411510 |
9 | 4634686131626 |
10 | 1330314351432 |
11 | 4732018520a0 |
12 | 1959a7702320 |
13 | 985a96436b1 |
14 | 4855d66117a |
15 | 2491044538c |
hex | 135bcea1348 |
1330314351432 has 64 divisors (see below), whose sum is σ = 3629560838400. Its totient is φ = 402966584640.
The previous prime is 1330314351403. The next prime is 1330314351449. The reversal of 1330314351432 is 2341534130331.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 1330314351393 and 1330314351402.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 322038 + ... + 1662629.
It is an arithmetic number, because the mean of its divisors is an integer number (56711888100).
Almost surely, 21330314351432 is an apocalyptic number.
1330314351432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1330314351432 is an abundant number, since it is smaller than the sum of its proper divisors (2299246486968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330314351432 is a wasteful number, since it uses less digits than its factorization.
1330314351432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1987226 (or 1987222 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 33.
Adding to 1330314351432 its reverse (2341534130331), we get a palindrome (3671848481763).
The spelling of 1330314351432 in words is "one trillion, three hundred thirty billion, three hundred fourteen million, three hundred fifty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •