Base | Representation |
---|---|
bin | 10111011100101111011001… |
… | …000010110010011011111000 |
3 | 111112011010211001211001000020 |
4 | 113130233121002302123320 |
5 | 102004140421342143000 |
6 | 1003201151525010440 |
7 | 30502622021566266 |
oct | 2734573102623370 |
9 | 445133731731006 |
10 | 103130101131000 |
11 | 2a951259546219 |
12 | b69737a253a20 |
13 | 4571185798ba8 |
14 | 1b677487bb436 |
15 | bdc9b5ba1ba0 |
hex | 5dcbd90b26f8 |
103130101131000 has 128 divisors (see below), whose sum is σ = 321771096129600. Its totient is φ = 27500917516800.
The previous prime is 103130101130933. The next prime is 103130101131049. The reversal of 103130101131000 is 131101031301.
It is a super-2 number, since 2×1031301011310002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 213637906 + ... + 214120094.
Almost surely, 2103130101131000 is an apocalyptic number.
103130101131000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103130101131000 is an abundant number, since it is smaller than the sum of its proper divisors (218640994998600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103130101131000 is a wasteful number, since it uses less digits than its factorization.
103130101131000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 553506 (or 553492 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 15.
Adding to 103130101131000 its reverse (131101031301), we get a palindrome (103261202162301).
The spelling of 103130101131000 in words is "one hundred three trillion, one hundred thirty billion, one hundred one million, one hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •