Base | Representation |
---|---|
bin | 101001001010101… |
… | …0000110110000100 |
3 | 10120021011121020120 |
4 | 1102111100312010 |
5 | 10312103240412 |
6 | 345022101540 |
7 | 46141622262 |
oct | 12225206604 |
9 | 3507147216 |
10 | 1381305732 |
11 | 649790494 |
12 | 32671a8b0 |
13 | 190234791 |
14 | d1647432 |
15 | 81400b8c |
hex | 52550d84 |
1381305732 has 12 divisors (see below), whose sum is σ = 3223046736. Its totient is φ = 460435240.
The previous prime is 1381305713. The next prime is 1381305749. The reversal of 1381305732 is 2375031831.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1381305693 and 1381305702.
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, 57554394 + ... + 57554417.
It is an arithmetic number, because the mean of its divisors is an integer number (268587228).
Almost surely, 21381305732 is an apocalyptic number.
1381305732 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1381305732 is an abundant number, since it is smaller than the sum of its proper divisors (1841741004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1381305732 is a wasteful number, since it uses less digits than its factorization.
1381305732 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115108818 (or 115108816 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 33.
The square root of 1381305732 is about 37165.9216487362. The cubic root of 1381305732 is about 1113.6873106407.
The spelling of 1381305732 in words is "one billion, three hundred eighty-one million, three hundred five thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •