Base | Representation |
---|---|
bin | 10011111100001110111… |
… | …011110100100101000011 |
3 | 11212000002201010022212201 |
4 | 103330032323310211003 |
5 | 134422431323132212 |
6 | 2525310003534031 |
7 | 201001300264006 |
oct | 23741673644503 |
9 | 4760081108781 |
10 | 1370345130307 |
11 | 48918411281a |
12 | 1a16b998a317 |
13 | 9c2b8bb15ba |
14 | 4a479d6153d |
15 | 259a49abb57 |
hex | 13f0eef4943 |
1370345130307 has 4 divisors (see below), whose sum is σ = 1370794574200. Its totient is φ = 1369895686416.
The previous prime is 1370345130299. The next prime is 1370345130337. The reversal of 1370345130307 is 7030315430731.
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 1370345130307 - 23 = 1370345130299 is a prime.
It is a super-3 number, since 3×13703451303073 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1370345130337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 224717373 + ... + 224723470.
It is an arithmetic number, because the mean of its divisors is an integer number (342698643550).
Almost surely, 21370345130307 is an apocalyptic number.
1370345130307 is a deficient number, since it is larger than the sum of its proper divisors (449443893).
1370345130307 is an equidigital number, since it uses as much as digits as its factorization.
1370345130307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 449443892.
The product of its (nonzero) digits is 79380, while the sum is 37.
The spelling of 1370345130307 in words is "one trillion, three hundred seventy billion, three hundred forty-five million, one hundred thirty thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •